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?
A
G is a cycle
B
G is a perfect matching
C
G is a complete graph
D
There is no such graph G

Explanation

Correct : b

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science