Register

Testbook Test Series: Graph Theory - Counting

• edited by
466 views
1 votes
1 votes

• edited by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
0 answers
2
Sahil_Lather asked Jan 27, 2023
367 views
TestBook graph theory question
If G is a simple planar connected graph with 5 vertices, how many edges in maximum can be there in the given graph?
If G is a simple planar connected graph with 5 vertices, how many edges in maximum can be there in the given graph?
User Avatar
0 votes
0 votes
0 answers
3
Sahil_Lather asked Jan 27, 2023
521 views
TestBook graph theory questions
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
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)A13B17Cn(n−1)2−13×17Dn(n−1)2−2
User Avatar
2 votes
2 votes
1 answer
4
Prince Sindhiya asked Nov 17, 2018
912 views
Zeal Test Series 2019: Graph Theory - Counting
Is there any short trick to do it ?
Is there any short trick to do it ?
User Avatar
Link Copied!