4 Graph G is a simply connected Eulerian graph with 4 vertices.
- Explain why graph G cannot be a complete graph.
- Determine the number of arcs in graph G, explaining your reasoning.
- Show that graph G is a bipartite graph.
Graph H is a digraph with 4 vertices and no undirected arcs. The adjacency matrix below shows the number of arcs that directly connect each pair of vertices in digraph H .
From
\begin{table}[h]
\captionsetup{labelformat=empty}
\caption{To}
- Write down a feature of the adjacency matrix that shows that H has no loops.
- Find the number of \(\operatorname { arcs }\) in H .
- Draw a possible digraph H .
- Show that digraph H is semi-Eulerian by writing down a suitable trail.