4 Two graphs are shown below. Each has exactly five vertices with vertex orders 2, 3, 3, 4, 4 .
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{a6800c9f-583b-493a-906c-015df63b842f-3_605_616_360_278}
\captionsetup{labelformat=empty}
\caption{Graph 1}
\end{figure}
\begin{figure}[h]
\includegraphics[alt={},max width=\textwidth]{a6800c9f-583b-493a-906c-015df63b842f-3_420_501_497_1169}
\captionsetup{labelformat=empty}
\caption{Graph 2}
\end{figure}
- Write down a semi-Eulerian route for graph 1 .
- Explain how the vertex orders show that graph 2 is also semi-Eulerian.
- By referring to specific vertices, explain how you know that these graphs are not simple.
- By referring to specific vertices, explain how you know that these graphs are not isomorphic.