is a connected graph with no cycles (acyclic)
is a connected graph with edges
is connected, but removing an edge disconnects
is acyclic graph, but adding an edge that connects any two not incident vertices makes cyclic.
For all pairs of vertices
exists only one path in with endpoints and .