Homework Clinic
Mathematics Clinic => Other Maths => Topic started by: sc00by25 on May 5, 2020
-
Assume that G is a graph with no loops or multiple edges. Which of the following graphs G are definitely trees?
◦ G has 14 vertices, is connected, and every edge in G is a bridge.
◦ G has 14 vertices, 13 edges, and no circuits.
◦ G has 14 vertices and there is exactly one path from any vertex to any other vertex.
◦ all of these are trees.
◦ none of these are trees.
-
all of these are trees.
-
thank you