Have an account?
Skip to Content
Build your own quiz
Suggestions for you
32 questions
Show Answers
See Preview
- 1. Multiple Choice
Tracing all edges on a figure without picking up your pencil or repeating edges and starting and stopping at different spots
Euler Circuit
Euler Path
- 2. Multiple Choice
Tracing all edges on a figure without picking up your pencil or repeating edges and starting and stopping in the same spot
Euler Circuit
Euler Path
- 3. Multiple ChoiceEuler paths must touchall edgesall vertices
- 4. Multiple ChoiceWhich of the following is false?Euler Paths exist when there are exactly two vertices of odd degree.Euler circuits exist when the degree of all vertices are even.A graph with more than two odd vertices will never have an Euler Path or Circuit.A graph with one odd vertex will have an Euler Path but not an Euler Circuit.
- 5. Multiple Choice
Does this graph have an Euler Path, Euler Circuit, both, or neither?Euler PathEuler CircuitBothNeither - 6. Multiple ChoiceThis graph will have a Euler's CircuitTrueFalse
- 7. Multiple ChoiceIdentify the Euler's CircuitKLQPQOKLOMKKLQMPQOKNLOMKKLQMPQOKKMOLNKOQMK
- 8. Multiple Choice
Is the following graph complete?
Yes
No
- 9. Multiple Choice
Is the following graph complete?
Yes
No
- 10. Multiple Choice
Is the following graph connected?
Yes
No
- 11. Multiple Choice
Is the following graph connected?
Yes
No
- 12. Multiple Choice
In the graph above, which of the following statements is true?
A is adjacent to E
A is not adjacent to D
C is adjacent to D
C is not adjacent to E
- 13. Multiple Choice
In a Hamiltonian Path, you must
Travel every edge once and only once, returning to where you started
Travel to every vertex once and only once, returning to where you started
Travel every edge once and only once, not returning to where you started
Travel to every vertex once and only once, not returning to where you started
- 14. Multiple Choice
In the following graph, decide which of the following is true: (could be more than one)
You can find a Hamiltonian Path if you travel 1, 5, 2, 3, 4, 6
You can find a Euler Path if you travel 1, 5, 2, 3, 4, 6
You cannot find a Hamiltonian Path
You cannot find a Euler Path
- 15. Multiple Choice
State whether you can find a Hamiltonian path, circuit or neither.
Path
Circuit
Neither
- 16. Multiple Choice
Find the Hamiltonian Path
1, 3, 4, 3, 2
1, 2, 3, 4
2, 3, 4, 3, 1
There is none
- 17. Multiple Choice
A simple graph ...
has no edges
no loops
no multiple edges
no loops nor multiple edges
- 18. Multiple Choice
A connected graph has ...
no loops
no multiple edges
no isolated vertices
each vertex connected to every other vertex
- 19. Multiple Choice
A complete graph has ...
no isolated vertices
no multiple edges
each vertex connected to every other vertex
no isolated vertices
- 20. Multiple Choice
How many edges would a complete graph have if it had 6 vertices?
15
20
25
30
- 21. Multiple Choice
What is the degree sum of a complete graph that has 4 vertices?
6
8
10
12
- 22. Multiple ChoiceWhich of the four graphs pictured below are trees?Graph 2Graph 2, 4Graph 2, 3Graph 2,3,4
- 23. Multiple ChoiceWhich of the four graphs pictured below are not trees?Graph 3Graph 2, 4Graph 2, 3Graph 1,3
- 24. Multiple ChoiceThe number of vertices in a tree with 12 edges is10111213
- 25. Multiple ChoiceAssume graph G has no loops or multiple edges. Which of the following graphs are definitely trees?G has 9 vertices and 8 bridgesG has 11 vertices and 9 edgesG has 7 vertices and no circuitsAll graphs are trees
- 26. Multiple Choice
The number of edges in a tree with 32 vertices is
30
31
32
33
- 27. Multiple Choice
In the graph shown, D is an example of a(n) ________ .
Edge
Vertex
Path
Sling
- 28. Multiple Choice
In the graph shown, (A, F) is an example of a(n) ________ .
Edge
Vertex
Path
Sling
- 29. Multiple Choice
Vertices are considered adjacent if ________ .
An edge connects them
There is a path from one vertex to the other
Both vertices are contained in a cycle
The length of the path between them is less than 5
- 30. Multiple Choice
A complete graph is a graph _________ .
where every vertex has a degree >= 1
that has the maximum number of edges connecting vertices
that for any two vertices, the graph has a path
that has at least one edge to every vertex
- 31. Multiple Choice
What is the length of the path F, A, C, B, D?
3
4
5
6
- 32. Multiple Choice
T/F: Networks can be directed or undirected
True
False
- Answer choicesTagsAnswer choicesTags