retagged by
487 views
0 votes
0 votes

Let Gn be the complete bipartite graph K13, 17 then the chromatic number of G̅n is _____ (G̅n is complement of Gn and n = 30)

  • A

    13

  • B

    17

  • C

    n(n−1)2−13×17

  • D

    n(n−1)2−2

retagged by

Please log in or register to answer this question.

Related questions

1 votes
1 votes
1 answer
2
Lone Wolf asked Sep 23, 2018
997 views
consider a complete bipartite graph K(3,3)The ratio of total number of possible vertex induced subgraphs to the total number of possible edge induced subgraph in given bi...
0 votes
0 votes
2 answers
3
Tesla! asked Apr 2, 2017
778 views
let G=(V,E) be an connected graph, let $\left | V \right |= n$Find largest value of n such thati) G is complete &ii) G is bipartitewith valid proof
1 votes
1 votes
0 answers
4
Sahil_Lather asked Jan 27, 2023
354 views
If G is a simple planar connected graph with 5 vertices, how many edges in maximum can be there in the given graph?