Consider a simple undirected unweighted graph with at least three vertices. If is the adjacency matrix of the graph, then the number of 3-cycles in the graph is given by the trace of
- A
- Bdivided by 2
- Cdivided by 3
- Ddivided by 6
Discrete MathematicsGraph Theory (Connectivity, Paths, Cycles, Trees)MCQ2 marks · −2/3 if wrongHard
A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.