Let 𝐴 be the adjacency matrix of a simple undirected graph 𝐺. Suppose 𝐴 is…
GATE · 2024 · CS · Set 2 · Computer Science & IT
Let 𝐴 be the adjacency matrix of a simple undirected graph 𝐺. Suppose 𝐴 is its own inverse. Which one of the following statements is always TRUE?
- A.
𝐺 is a cycle
- B.
𝐺 is a perfect matching
- C.
𝐺 is a complete graph
- D.
There is no such graph 𝐺
Attempted by 310 students.
Sign up free to check your answer
Sign up freeLoading lesson…