[Solved] What is the multiplicity for the adjacency matrix of complete bipartite graph for 0 Eigen value?

Computer Science Engineering (CSE)
Design and Analysis of Algorithms
What is the multiplicity for the adjacen...

Q.	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
Answer» B. n + m – 2
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.

View all MCQs in: Design and Analysis of Algorithms

Discussion

Related Questions

What is the multiplicity for the laplacian matrix of the complete bipartite graph for n Eigen value?
Which of the following is not an Eigen value of the adjacency matrix of the complete bipartite graph?
Which of the following is not an Eigen value of the Laplacian matrix of the complete bipartite graph?
What is testing of a complete bipartite subgraph in a bipartite graph problem called?
A k-regular bipartite graph is the one in which degree of each vertices is k for all the vertices in the graph. Given that the bipartitions of this graph are U and V respectively. What is the relation between them?
Is every complete bipartite graph a Moore Graph.
Is it true that every complete bipartite graph is a modular graph.
Consider the graph M with 3 vertices. Its adjacency matrix is shown below. Which of the following is true?
What is the chromatic number of compliment of line graph of bipartite graph?
What is the clique size of the line graph of bipartite graph?