# YOU CAN DOWNLOAD 200+ SUBJECTS PDF BOOK FOR COMPETITIVE EXAMINATIONS CLICK HERE TO DOWNLOAD

## Complete Bipartite Graph Multiple choice Questions and Answers (MCQs)

 Question 11 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
What is the multiplicity for the adjacency matrix of complete bipartite graph for 0 Eigen value?
 A 1 B n + m - 2 C 0 D 2
Question 11 Explanation:
The adjacency matrix is a square matrix that is used to represent a finite graph. The multiplicity of the adjacency matrix off complete bipartite graph with Eigen Value 0 is n + m - 2.

 Question 12 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
What are the Eigen values for the Laplacian matrix of the complete bipartite graph?
 A n + m B n C 0 D All of the mentioned
Question 12 Explanation:
The laplacian matrix is used to represent a finite graph in the mathematical field of Graph Theory. Therefore, the Eigen values for the complete bipartite graph is found to be n + m, n, m, 0.

 Question 13 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
What is the multiplicity for the laplacian matrix of the complete bipartite graph for n Eigen value?
 A 1 B m-1 C n-1 D 0
Question 13 Explanation:
The laplacian matrix is used to represent a finite graph in the mathematical field of Graph Theory. The multiplicity of the laplacian matrix of complete bipartite graph with Eigen Value n is m-1.

 Question 14 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
Is it true that every complete bipartite graph is a modular graph.
 A True B False
Question 14 Explanation:
Yes, the modular graph in graph theory is defined as an undirected graph in which all three vertices have at least one median vertex. So all complete bipartite graph is called modular graph.

 Question 15 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
How many spanning trees does a complete bipartite graph contain?
 A nm B mn-1 * nn-1 C 1 D 0
Question 15 Explanation:
Spanning tree of a given graph is defined as the subgraph or the tree with all the given vertices but having minimum number of edges. So, there are a total of mn-1 * nn-1 spanning trees for a complete bipartite graph.

There are 15 questions to complete.