Item 4.1.9.a.
Two different trees with the same number of vertices and the same number of edges. A tree is a connected graph with no cycles.
Two different trees with the same number of vertices and the same number of edges. A tree is a connected graph with no cycles.