Ononot — A graph G has an adjacency matrix A such that A^3 has diagon

Guest Session: 1 Question Remaining. Create Account to save progress.

Graph Theoryhard

0:00.0

A graph $G$ has an adjacency matrix $A$ such that $A^3$ has diagonal entries all equal to $12$ . What is the number of triangles in $G$ ?