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.
3.8k
0
Do you find this helpful?
28

View all MCQs in

Design and Analysis of Algorithms

Discussion

No comments yet

Related MCQs