trees and graphs

cube0003.gif: a tree of a cube.

This tree has 8 vertices and 7 edges. All trees of connected graphs have one less edge than vertice.

As well as being a tree of a cube, all trees are also a tree of the maximum graph.

- Cube 2: the maximum graph for 8 vertices.
- Cube 4: a path connecting the vertices of this cube.
- Cube 8: a tree that is not a tree of this cube.

Links at other sites...

Created 22/6/99

Modified 5/7/99