16 questions
What is the degree of vertex 4?
3
4
5
7
Which two vertices are adjacent vertices?
5 is adjacent to 6
3 is adjacent to 6
4 is adjacent to 1
3 is adjacent to 2
The graph represents the following vocabulary term.
Cycle
Path
Complete Graph
Complete Bipartite Graph
The graph is an example of a
Path
Cycle
Complete Bipartite Graph
Complete Graph
Which vocabulary term describes the graph?
circuit
path
complete graph
polygon
Which of the following are isolated vertices?
F
G
Graphs are fun.
F and G
Which of the following is a loop?
BC
EE
AB
BF
none
What is the degree of vertex E?
1
2
3
4
5
Circuits start and stop at
same vertex
different vertices
DUI Checkpoints
the sound of the bass
Paths start and stop at
same vertex
different vertices
the beginning and the end
green lights and red lights
Eulerian and Hamiltonian graphs are disconnected graphs
True
False
Is the following graph connected?
Yes
No
Is the following graph connected?
Yes
No
A Hamiltonian cycle is
A cycle that includes every vertex
A cycle that includes every vertex more than once
A cycle that includes every edge
A cycle that includes every edge more than once