Let be the adjacency matrix of a simple undirected graph . Suppose is its own inverse. Which one of the following statements is always TRUE?
- Ais a cycle
- Bis a perfect matching
- Cis a complete graph
- DThere is no such graph
Discrete MathematicsGraph Theory (Connectivity, Paths, Cycles, Trees)MCQ1 mark · −1/3 if wrongMedium
A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.