Let $A$ be the adjacency matrix of a simple undirected graph $G$. Suppose $A$ is its own inverse. Which one of the following statements is always TRUE?
A² = I means each vertex has degree 1 (diagonal of A² is the degree) and off-diagonals vanish, so every vertex has exactly one neighbour: a perfect matching.
More Discrete Mathematics: Graphs (Connectivity, Matching, Colouring) questions
GATE 2024 CS (CS2) Q51– Let G be an undirected connected graph in which every edge has a positive integer weight.…
GATE 2024 CS (CS2) Q60– The chromatic number of a graph is the minimum number of colours used in a proper…
GATE 2023 CS Q55– Let G be a simple, finite, undirected graph with vertex set \v 1,,v n\. Let (G) denote the…
GATE 2022 CS Q30– Consider a simple undirected graph of 10 vertices. If the graph is disconnected, then the…
GATE 2022 CS Q37– Consider a simple undirected unweighted graph with at least three vertices. If A is the…
GATE 2022 CS Q50– The following simple undirected graph is referred to as the Peterson graph. Which of the…