Let X be the adjacency matrix of a graph G with no self loops. The entries…
ISRO Scientist/Engineer SC · 2007 · Computer ScienceBEL Probationary Engineer · 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 1115 students.
Sign up free to check your answer
Sign up freeLoading lesson…