DT Q21

Home
DT Q21

0. A undirected graph G has n nodes. Its adjacency matrix is given by an n x n square matrix whose
1. diagonal elements are 0's, and
2. non-diagonal elements are l's.
Which one of the following is TRUE?

Answer
Comment
Array

Option : C
Explanation :
In adjacency matrix if diagonal elements are 0’s and non-diagonal are 1’s then it is complete graph and in complete graph of n vertices total n^n–2 Spanning trees are possible and cost of each tree. is (n – 1) because for n vertex graph, (n – 1) edges required in a tree.

Forgot your password?

I agree with the Terms.