Suppose a graph \(G\) has the following second power of the adjacency matrix:
$$ A^2 = \left( \begin{array}{cccc}1 & 0 & 1 & 1\\0 & 3 & 1 & 1\\1 & 1 & 2 & 1\\1 & 1 & 1 & 2 \end{array}\right) $$
Which one could be \(G\)?
a)
b)
c) 
d) 
e) None of the above
Original idea by: Leticia Marques
No comments:
Post a Comment