Consider a Connected Graph with N Vertices; If N -

question 20

Multiple Choice

Consider a connected graph with n vertices; if n - 1 of the vertices have degree 1, then the graph is a tree.

• A) This statement is always true.
• B) This statement is always false.
• C) This statement is always true if and only if one vertex has degree n - 1.
• D) This statement is only false if and only if one vertex has degree n - 1.
• E) None of the above.