Open In App

ISRO | ISRO CS 2007 | Question 62

Last Updated : 25 Jun, 2018
Like Article
Like
Save
Share
Report

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


Like Article
Suggest improvement
Previous
Next
Share your thoughts in the comments

Similar Reads