ISRO | ISRO CS 2007 | Question 62
Let X be the adjacency matrix of a graph G with no self loops. The entries along the principal diagonal of X are
(A) all zeros
(B) all ones
(C) both zeros and ones
Explanation: In an adjacency matrix of a graph G the entries along the principal diagonal are reflexive, i.e. elements showing connectivity with themselves. Since the GrapH G has no self loops so all these entries should be 0.
Option (A) is correct.
Quiz of this Question