Solve the problem.Assume that G is a graph with no loops or multiple edges. It is known that G has 5 vertices, 4 edges, and that the degree of each vertex is either 1 or 2. What can be said about G?
A. G is not a tree.
B. G has 4 bridges.
C. G is a tree.
D. G could be a tree.
E. none of these
Answer: D
Mathematics
You might also like to view...
Write the Hindu-Arabic numeral that the given Roman numeral represents.
MMXV
A. 7015 B. 7115 C. 6915 D. 7116
Mathematics
Perform the indicated operations and simplify the result. Leave the answer in factored form.
? 
A. 
B. 
C. 
D. 
Mathematics
Factor.3x3 + 9x2 - 30x
A. (x - 2)(3x2 + 15) B. 3x(x + 2)(x - 5) C. 3x(x - 2)(x + 5) D. (3x2 + 6x)(x - 5)
Mathematics
Find the midpoint of the segment with the given endpoints.(1, 3) and (7, 2)
A. 
B. 
C. 
D. 
Mathematics