Question 1
Suppose G is a graph with 39 vertices and 38 edges. Then
◦ G must be a tree.
◦ G cannot have more than one path joining any two vertices.
◦ G cannot have any circuits.
◦ G is either a tree or it is not connected.
◦ none of these
Question 2
Suppose G is a graph with 51 vertices and 50 edges. Then
◦ G cannot have more than one path joining any two vertices.
◦ G must be a tree.
◦ G is either a tree or is not connected.
◦ G cannot have any circuits.
◦ none of these