Let X be the adjacency matrix of a graph G with no self loops. The entries…
ISRO Scientist/Engineer SC · 2007 · Computer ScienceBEL · Computer Science · 2007
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
Attempted by 1058 students.
Show answer
Correct answer: A
The worked solution is available to enrolled students.
Video solution available to enrolled students.
Explore the full course: Iocl Engineers Officers Grade A Paper 2
Loading lesson…