GATE CS 2024 (Afternoon) — Question 17

Discrete MathematicsGraph Theory (Connectivity, Paths, Cycles, Trees)MCQ1 mark · −1/3 if wrongMedium

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?
  1. A
    \( G \) is a cycle
  2. B
    \( G \) is a perfect matching
  3. C
    \( G \) is a complete graph
  4. D
    There is no such graph \( G \)
Practise the full 2024-AN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAWhat rank do your marks get?GATE score, likely All-India Rank and qualifying marks for your category.
Practise more on Graph Theory (Connectivity, Paths, Cycles, Trees)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group