Computer Sciences > Gate 2022 > Graph
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

Correct : d

Similar Questions

Let G = (V, G) be a weighted undirected graph and let T be a Minimum Spanning Tree (MST) of G maintained using adjacency lists. Suppose a new weighed edge (u, v...
#280 MCQ
Consider a simple undirected graph of 10 vertices. If the graph is disconnected, then the maximum number of edges it can have is ____________.
#661 Fill in the Blanks
Suppose you look at a three-dimensional figure. Which of the following must necessarily be true?
#798 MCQ

Related Topics

graph theory GATE 2022 adjacency matrix trace undirected graph computer science gate count cycles in graph cycle detection algorithm GATE computer sciences graph properties computing cycles

Unique Visitor Count

Total Unique Visitors

Loading......

Question Options

Contributed by: