Let $A$ be the adjacency matrix of a graph $G$ with 5 vertices. The following represents $A^2$. $$\left( \begin{array} { l l l l l } 4 & 3 & 3 & 2 & 2 \\ 3 & 4 & 3 & 2 & 2 \\ 3 & 3 & 4 & 2 & 2 \\ 2 & 2 & 2 & 3 & 3 \\ 2 & 2 & 2 & 3 & 3 \end{array} \right)$$ Choose all correct statements about graph $G$ from the given options. [4 points] Options ㄱ. There are 2 vertices with degree 3. ㄴ. It has a Hamiltonian circuit. ㄷ. There are at least 2 paths consisting of 2 edges connecting any two distinct vertices. (1) ㄱ (2) ㄷ (3) ㄱ, ㄴ (4) ㄴ, ㄷ (5) ㄱ, ㄴ, ㄷ
Let $A$ be the adjacency matrix of a graph $G$ with 5 vertices. The following represents $A^2$.
$$\left( \begin{array} { l l l l l } 4 & 3 & 3 & 2 & 2 \\ 3 & 4 & 3 & 2 & 2 \\ 3 & 3 & 4 & 2 & 2 \\ 2 & 2 & 2 & 3 & 3 \\ 2 & 2 & 2 & 3 & 3 \end{array} \right)$$
Choose all correct statements about graph $G$ from the given options. [4 points]
\textbf{Options}\\
ㄱ. There are 2 vertices with degree 3.\\
ㄴ. It has a Hamiltonian circuit.\\
ㄷ. There are at least 2 paths consisting of 2 edges connecting any two distinct vertices.\\
(1) ㄱ\\
(2) ㄷ\\
(3) ㄱ, ㄴ\\
(4) ㄴ, ㄷ\\
(5) ㄱ, ㄴ, ㄷ