Computer Sciences > GATE 2024 Set-2 > Graph Theory
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?
Suppose A is its own inverse.
Which one of the following statements is always TRUE?
Correct : b
Similar Questions
Let G be an undirected connected graph in which every edge has a positive integer weight. Suppose that every spanning tree in G has even weight. Which of the fo...
Let G be an undirected connected graph in which every edge has a positive integer weight. Suppose that every spanning tree in G has even weight. Which of the fo...
Let G be an undirected connected graph in which every edge has a positive integer weight. Suppose that every spanning tree in G has even weight. Which of the fo...
Total Unique Visitors
Loading......