Consider a simple undirected unweighted graph with at least three vertices. If…
GATE · 2022 · CS · Computer Science & IT
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
- A.
A3
- B.
A3 divided by 2
- C.
A3 divided by 3
- D.
A3 divided by 6
Attempted by 458 students.
Sign up free to check your answer
Sign up freeLoading lesson…