@vijaycs he answered it considering a particular case of 1 node.

5 votes

Let $X$ be the adjacency matrix of a graph $G$ with no self loops. The entries along the principal diagonal of $X$ are

- all zeros
- all ones
- both zeros and ones
- different

7 votes

Best answer