Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

ISRO | ISRO CS 2007 | Question 62

  • Last Updated : 25 Jun, 2018

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
(D) different


Answer: (A)

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

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!