GATE CS 2022 (Forenoon) — Question 37

Discrete MathematicsGraph Theory (Connectivity, Paths, Cycles, Trees)MCQ2 marks · −2/3 if wrongHard

Consider a simple undirected unweighted graph with at least three vertices. If \(A\) is the adjacency matrix of the graph, then the number of 3-cycles in the graph is given by the trace of
  1. A
    \(A^3\)
  2. B
    \(A^3\) divided by 2
  3. C
    \(A^3\) divided by 3
  4. D
    \(A^3\) divided by 6
Practise the full 2022-FN 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