Eulerian Trails and Circuits 1
Try VividMath Premium to unlock full access
Time limit: 0
Quiz summary
0 of 4 questions completed
Questions:
- 1
- 2
- 3
- 4
Information
–
You have already completed the quiz before. Hence you can not start it again.
Quiz is loading...
You must sign in or sign up to start the quiz.
You have to finish following quiz, to start this quiz:
Loading...
- 1
- 2
- 3
- 4
- Answered
- Review
-
Question 1 of 4
1. Question
Which of the following networks has an Eulerian trail?Hint
Help VideoCorrect
Great Work!
Incorrect
An Eulerian trail is a trail with exactly `2` odd vertices and starts and ends on either of the odd vertices.Check each network if they fit the categories for a Eulerian trail.Start by counting the degrees of each network’s vertices.`1`st Figure
This network does not have any odd vertices. Therefore, it does not have an Eulerian trail.`2`nd Figure
This network has more than two odd vertices. Therefore, it does not have an Eulerian trail.`3`rd Figure
This network does not have any odd vertices. Therefore, it does not have an Eulerian trail.`4`th Figure
This network has exactly two odd vertices. Therefore, it may have an Eulerian trail.Next, further check if the `4`th figure has a Eulerian trail by drawing a diagram to check if the trail starts at one odd vertex and ends on the other odd vertex.You can mark the starting vertex with `S` and the finishing vertex with `F`.
Either of the two diagrams illustrate that you can start on either odd vertex and end on the other. Therefore, the `4`th figure fits both categories for a Eulerian trail.
-
Question 2 of 4
2. Question
Which of the following networks has an Eulerian trail?Hint
Help VideoCorrect
Correct!
Incorrect
An Eulerian trail is a trail with exactly `2` odd vertices and starts and ends on either of the odd vertices.Check each network if they fit the categories for a Eulerian trail.Start by counting the degrees of each network’s vertices.`1`st Figure
This network has more than two odd vertices. Therefore, it does not have an Eulerian trail.`2`nd Figure
This network has more than two odd vertices. Therefore, it does not have an Eulerian trail.`3`rd Figure
This network has more than two odd vertices. Therefore, it does not have an Eulerian trail.`4`th Figure
This network has exactly two odd vertices. Therefore, it may have an Eulerian trail.Next, further check if the `4`th figure has a Eulerian trail by drawing a diagram to check if the trail starts at one odd vertex and ends on the other odd vertex.You can mark the starting vertex with `S` and the finishing vertex with `F`.
The diagram illustrates that you can start on one odd vertex and end on the other. Therefore, the `4`th figure fits both categories for a Eulerian trail.
-
Question 3 of 4
3. Question
Which of the following networks has an Eulerian circuit?Hint
Help VideoCorrect
Well Done!
Incorrect
An Eulerian circuit is a circuit with all of its vertices having even degrees, starts and ends on the same vertex, and passes on all the edges only once.Check each network if they fit the categories for an Eulerian circuit.Start by counting the degrees of each network’s vertices.`1`st Figure
Not all vertices are even for this network. Therefore, it does not have an Eulerian circuit.`2`nd Figure
Not all vertices are even for this network. Therefore, it does not have an Eulerian circuit.`3`rd Figure
Not all vertices are even for this network. Therefore, it does not have an Eulerian circuit.`4`th Figure
This network’s vertices all has even degrees. Therefore, it fits one category for an Eulerian circuit.Next, further check if the `4`th figure has an Eulerian circuit by drawing a diagram to check if the trail starts and ends on the same vertex and if it passes all the edges once.You can mark the starting and finishing vertex with both `S` and `F`.
This diagram illustrates that you can start and finish on the same vertex and pass through all edges just once. Therefore, the `4`th figure fits all categories for an Eulerian circuit.
-
Question 4 of 4
4. Question
The roads for a new mailbox delivery route is shown in this network diagram. The delivery will start and end at `P` and will travel along each road once. Answer the following questions:
Answer `Y` for yes or `N` for no-
`(i)` Does an Eulerian circuit exist on the given network?`=` (Y, y)`(ii)` Can the Eulerian circuit start at `U`?`=` (Y, y)`(iii)`Can the Eulerian circuit start at `R`?`=` (Y, y)
Hint
Help VideoCorrect
Nice Job!
Incorrect
An Eulerian circuit is a circuit with all of its vertices having even degrees, starts and ends on the same vertex, and passes on all the edges only once.`(i)` Does an Eulerian circuit exist on the given network?Check the network if they fit the categories for an Eulerian circuit.Start by counting the degrees of each network’s vertices.
This network’s vertices all has even degrees. Therefore, it fits one category for an Eulerian circuit.Next, further check if the figure has an Eulerian circuit by drawing a diagram to check if the trail starts and ends vertex P and if it passes all the edges once.
This diagram illustrates that you can start and finish on vertex `P` and pass through all edges just once. Therefore, an Eulerian trail exists for this network.`(ii)` Can the Eulerian circuit start at `U`?Check if the Eulerian circuit can start and end vertex U and if it passes all the edges once.
This diagram illustrates that a Eulerian circuit can start and finish on vertex `U` and pass through all edges just once.`(iii)` Can the Eulerian circuit start at `R`?Check if the Eulerian circuit can start and end vertex R and if it passes all the edges once.
This diagram illustrates that a Eulerian circuit can start and finish on vertex `R` and pass through all edges just once.`(i)` Does an Eulerian circuit exist on the given network? `\text(Yes)``(ii)` Can the Eulerian circuit start at `U`? `\text(Yes)``(iii)` Can the Eulerian circuit start at `R`? `\text(Yes)` -
Quizzes
- Vertices and Edges
- Degrees 1
- Degrees 2
- Degrees 3
- Drawing A Network 1
- Drawing A Network 2
- Completing a Table from a Network Diagram
- Network from Maps and Plans
- Identifying Paths and Cycles
- Eulerian Trails and Circuits 1
- Eulerian Trails and Circuits 2
- Identifying Spanning Trees
- Minimum Spanning Trees 1
- Minimum Spanning Trees 2
- Shortest Path 1
- Shortest Path 2