What is the multiplicity for the adjacency matrix of complete bipartite graph for 0 Eigen value?
|B.||n + m – 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.|
Login to Continue
It will take less than 2 minutes