Q27

MCQ2 marks, −0.67

Consider a simple undirected unweighted graph with at least three vertices. If $\textit{A}$ is the adjacency matrix of the graph, then the number of $3–$ cycles in the graph is given by the trace of

(A)

$\textit{A}^{3}$

(B)

$\textit{A}^{3}$ divided by $2$

(C)

$\textit{A}^{3}$ divided by $3$

(D)

$\textit{A}^{3}$ divided by $6$

Loading…