Q7

MCQ1 mark, −0.33

Let $\text{A}$ be the adjacency matrix of a simple undirected graph $\text{G}$ . Suppose $\text{A}$ is its own inverse. Which one of the following statements is always TRUE?

(A)

$\text{G}$ is a cycle

(B)

$\text{G}$ is a perfect matching

(C)

$\text{G}$ is a complete graph

(D)

There is no such graph $\text{G}$

Loading…