Question 1 : How many spanning trees does a complete bipartite graph contain?
1. n^m
2. m^n-1 * n^n-1
3. 1
4. 0
View Answer   Discuss with Members

Question 2 : Is it true that every complete bipartite graph is a modular graph.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 3 : What is the multiplicity for the laplacian matrix of the complete bipartite graph for n Eigen value?
1. 1
2. m-1
3. n-1
4. 0
View Answer   Discuss with Members

Question 4 : What are the Eigen values for the Laplacian matrix of the complete bipartite graph?
1. n + m
2. n
3. 0
4. All of the mentioned
View Answer   Discuss with Members

Question 5 : What is the multiplicity for the adjacency matrix of complete bipartite graph for 0 Eigen value?
1. 1
2. n + m – 2
3. 0
4. 2
View Answer   Discuss with Members

Question 6 : Is every complete bipartite graph a Moore Graph.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 7 : Which complete graph is not present in minor of Outer Planar Graph?
1. K3, 3
2. K3, 1
3. K3, 2
4. K1, 1
View Answer   Discuss with Members

Question 8 : What are the Eigen values for the adjacency matrix of the complete bipartite graph?
1. (nm)^1/2
2. (-nm)^1/2
3. 0
4. All of the mentioned
View Answer   Discuss with Members

Question 9 : Which graph cannot contain K3, 3 as a minor of graph?
1. Planar Graph
2. Outer Planar Graph
3. Non Planar Graph
4. Inner Planar Graph
View Answer   Discuss with Members

Question 10 : What is testing of a complete bipartite subgraph in a bipartite graph problem called?
1. P Problem
2. P-Complete Problem
3. NP Problem
4. NP-Complete Problem
View Answer   Discuss with Members