GATE Computer Science (CS) 2022 Shift 1 Solved Paper
© examsiri.com
Question : 36 of 65
Marks:
+1,
-0
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
Go to Question: