Homework Clinic

Mathematics Clinic => Other Maths => Topic started by: madam-professor on May 5, 2020

Title: Assume that G is a graph with no loops or multiple edges. It is known that G has 5 vertices, 4 ...
Post by: madam-professor on May 5, 2020

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?
◦ G is a tree.
◦ G could be a tree.
◦ G is not a tree.
◦ G has 4 bridges.
◦ none of these

Title: Assume that G is a graph with no loops or multiple edges. It is known that G has 5 vertices, 4 ...
Post by: Amiracle on May 5, 2020

G could be a tree.