Consider the following graphs. Check that you can start at one vertex and travel along each edge exactly once without lifting your pen from the paper.
Each graph has a trail that uses every edge exactly once. The trail on the left is open and starts and finishes at different vertices. The graph on the right is closed and any vertex can be the start/end.
Traversable is the word to describe graphs where you can start at a vertex and draw in all the edges without taking your pen off the page or retracing any edge. The two types of traversable graphs are:
It is possible to determine if an undirected graph is Eulerian or semi-Eulerian without having to actually find the trail:
Describe the network below as Eulerian, semi-Eulerian or neither. Justify your answer.
Think: Calculate the degree of each vertex. Eulerian will have all even vertices, semi-Eulerian will have exactly two odd vertices.
Do: Write - The graph is semi-Eulerian because the top and bottom vertices are both odd (degree 5) and the other two vertices are even (degree 2).
Suppose $G$G is a very large network, with $300$300 vertices, each of even degree.
Does a semi-Eulerian trail exist for $G$G?
Select all that apply.
Does an Eulerian circuit exist for $G$G? Select all correct answers:
Consider the following network:
Is it possible to draw an Eulerian circuit (also called Euler circuit) on the following network?
Write an Eulerian circuit starting with the vertex $B$B.
Enter all the vertices on the same line, separated by a comma, like this: $M,N,O,P,M$M,N,O,P,M
Consider the network below:
Is the network Eulerian or semi-Eulerian?
Which vertex or vertices can the trail start at? Select all correct options:
Sarah has started to traverse through the graph, by moving along the vertices $B,C,D$B,C,D. Which vertices are possible to travel to next along such a trail? Select all the correct options.
Enter a semi-Eulerian trail for the network that completes Sarah's journey.
Enter each vertex as a capital letter in order, separated by commas.
When we looked at Eulerian graphs, we were focused on using each of the edges just once.
We will now look at Hamiltonian graphs, which are named after Sir William Hamilton - an Irish mathematician, physicist and astronomer.
A Hamiltonian graph is a graph which has a closed path (cycle) that visits each vertex exactly once, ending on the same vertex as it began. This closed path is also called a Hamiltonian cycle.
In the graph below, the Hamiltonian cycle is marked in red. As it is a cycle, we cannot have repeated edges or repeated vertices. Note that we do not need to use all the edges in order to visit each vertex once.
Other Hamiltonian cycles here include $ABDCA$ABDCA, $DBACD$DBACD, and many others.
A semi-Hamiltonian path is a path that visits every vertex once and starts and ends at different vertices. Semi-Hamiltonian graphs are sometimes called traceable.
If a graph has a Hamiltonian cycle then it automatically has a semi-Hamiltonian path (by just dropping off the last vertex in the cycle we create a path - for example, $ABDC$ABDC and $DBAC$DBAC in the graph above).
Unlike Eulerian and semi-Eulerian paths, there is no systematic procedure to help us identify if a semi-Hamiltonian path or Hamiltonian cycle exists. The only thing we can do is look for them.
Here are three networks:
The following graph is a complete graph. Recall that means each vertex is connected to every other vertex. It has many semi-Hamiltonian paths and Hamiltonian cycles. How many can you find?
Remember, a semi-Hamiltonian path is a path where we visit each of the vertices only once. Here is the full list of semi-Hamiltonian paths for this graph:
$ABCD$ABCD, $ABDC$ABDC, $ADCB$ADCB, $ADBC$ADBC, $ACBD$ACBD, $ACDB$ACDB, $BACD$BACD, $BADC$BADC, $BCDA$BCDA, $BCAD$BCAD, $BDAC$BDAC, $BDCA$BDCA, $CABD$CABD, $CADB$CADB, $CBDA$CBDA, $CBAD$CBAD, $CDBA$CDBA, $CDAB$CDAB, $DABC$DABC, $DACB$DACB, $DBAC$DBAC, $DBCA$DBCA, $DCAB$DCAB and $DCBA$DCBA.
So the list of semi-Hamiltonian paths is actually just all combinations of the four vertices $A$A, $B$B, $C$C and $D$D.
Also, because it is a complete graph all of the paths listed above can be turned into Hamiltonian cycles by returning to the original node.
In a complete graph with $n$n vertices, each vertex is connected to every other vertex by an edge.
Starting at any vertex there are $n-1$n−1 possible choices of vertices to visit next. After that, there are $n-2$n−2 vertices left to visit, and so on. Since every vertex is connected to every other vertex, this means there are $n!=n\times(n-1)\times(n-2)\times...\times2\times1$n!=n×(n−1)×(n−2)×...×2×1 possible Hamiltonian cycles.
For example, if a complete graph has $4$4 vertices the number of Hamiltonian cycles is given by:
State a semi-Hamiltonian path in the graph below. .
Think: In a semi-Hamiltonian path we need to visit each vertex once but do not need to use all the edges or form a cycle.
Do: The path $ABCDE$ABCDE is semi-Hamiltonian (there are others too!).
Determine if this directed network is Hamiltonian, semi-Hamiltonian or neither.
Think: For directed graphs, we can still have Hamiltonian/semi-Hamiltonian paths, to find one use trial and error and make sure you are following the arrows in the correct direction.
Do: This network is semi-Hamiltonian. The paths $PUTSQR$PUTSQR and $QSUTPR$QSUTPR visit each vertex once. It is not possible to create such a path that starts and ends at the same vertex, so the graph is not Hamiltonian.
Is it possible to draw a semi-Hamiltonian path on the following diagram?
Which of the following graphs are semi-Hamiltonian?
Select all the correct options.
A rock band is planning a tour across several cities. The following table represents the routes and distance between the cities at which they will be performing.
|Starting City||Ending City||Distance|
Which of the following graphs does the table represent?
Using either the correct graph or table given, find the shortest route for the rock band to cross starting at city $A$A and passing by each city only once.
List the vertices in order, separated by commas.
Contains an Eulerian trail - a closed trail (circuit) that includes all edges one time.
A graph is Eulerian if all vertices have even degree.
Contains a semi-Eulerian trail - an open trail that includes all edges one time.
A graph is semi-Eulerian if exactly two vertices have odd degree.
Contains a Hamiltonian cycle - a closed path that includes all vertices, other than the start/end vertex, one time.
Contains a semi-Hamiltonian path - an open path that includes all vertices once.
A graph can be a traversable Eulerian/semi-Eulerian, a Hamiltonian/semi-Hamiltonian network, both, or neither, as these examples demonstrate:
The first is Eulerian and Hamiltonian, the second is only Hamiltonian, the third is only Eulerian, and the fourth is neither.
explain the meaning of the terms: Eulerian graph, Eulerian trail, semi-Eulerian graph, semi-Eulerian trail and the conditions for their existence, and use these concepts to investigate and solve practical problems; for example, the Königsberg Bridge problem, planning a garbage bin collection route
explain the meaning of the terms: Hamiltonian graph and semi-Hamiltonian graph, and use these concepts to investigate and solve practical problems; for example, planning a sight-seeing tourist route around a city, the travelling-salesman problem (by trial-and-error methods only)