In what case are all the off-diagonal entries of the adjacency matrix of a graph G equal

Question:

In what case are all the off-diagonal entries of the adjacency matrix of a graph G equal to one?

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: