1.Previous
3.Next

conditions:
* is connected and has edges.
* is connected, and every subgraph of includes at least one vertex with zero or one incident edges. (That is, is connected and 1-degenerate.)
* has no simple cycles and has edges.As elsewhere in graph theory, the order-zero graph (graph with no vertices) is generally not considered to be a tree: while it is vacuously connected as a

1.Previous
3.Next