Multiple Choice
Use the theorem that relates the sum of degrees to the number of edges to determine the number of edges in the graph.
-A graph with 6 vertices, one of degree 5, three of degree 1, and two of degree 2.
A) 8 edges
B) 4 edges
C) 6 edges
D) 12 edges
Correct Answer:

Verified
Correct Answer:
Verified
Q30: Determine how many vertices and how many
Q31: Identify the cut edges in the
Q32: Determine how many vertices and how many
Q33: Decide if an Euler circuit exists for
Q34: Decide if an Euler circuit exists for
Q36: Represent the following with a graph.<br>-<img src="https://d2lvgg3v3hfg70.cloudfront.net/TB5007/.jpg"
Q37: Decide if an Euler circuit exists for
Q38: Determine how many vertices and how many
Q39: Determine how many components the graph has.<br>-<img
Q40: Identify the cut edges in the