Graph Theory I
Authored by Renee Torres
Mathematics
Professional Development
CCSS covered
Used 20+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
7 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
A sequence of adjacent vertices and the edges connecting them is called a
Path
Loop
Circuit
2.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
The number of edges that connect to a vertex is called the _____ of the vertex.
circuit
path
loop
degree
bridge
3.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
The number of odd vertices in the graph above is:
3
4
5
6
4.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
How many bridges in the above graph?
None
One
Two
Three
5.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
The following graph is connected. True/False
True
False
Not possible to determine
6.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
The diagram on the right is a floor plan. Letting vertices represent the room and the outside, and edges represent the connecting doors, which graph correctly models the floor plan?
Not one of the above
Tags
CCSS.HSA.CED.A.3
7.
MULTIPLE CHOICE QUESTION
30 sec • Ungraded
I enjoyed the quiz!
Yes!
No!
Not sure...:)
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports
Continue with Google
Continue with Email
Continue with Classlink
Continue with Clever
or continue with
Microsoft
%20(1).png)
Apple
Others
Already have an account?
