Tree (graph theory)

In mathematics, more specifically graph theory, a tree is an undirected graph in which any two vertices are connected by exactly one simple path. In other words, any connected graph without cycles is a tree. A forest is a disjoint union of trees.

The various kinds of data structures referred to as trees in computer science are equivalent to trees in graph theory, although such data structures are commonly rooted trees, and may have additional ordering of branches.

Definitions
A tree is an undirected simple graph G that satisfies any of the following equivalent conditions:

If G has finitely many vertices, say n of them, then the above statements are also equivalent to any of the following conditions:
 * G is connected and has no cycles.
 * G has no cycles, and a simple cycle is formed if any edge is added to G.
 * G is connected, but is not connected if any single edge is removed from G.
 * G is connected and the 3-vertex complete graph $$K_3$$ is not a minor of G.
 * Any two vertices in G can be connected by a unique simple path.
 * G is connected and has n &minus; 1 edges.
 * G has no simple cycles and has n &minus; 1 edges.

A leaf is a vertex of degree 1. An internal vertex is a vertex of degree at least 2.

An irreducible (or series-reduced) tree is a tree in which there is no vertex of degree 2.

A forest is an undirected graph, all of whose connected components are trees; in other words, the graph consists of a disjoint union of trees. Equivalently, a forest is an undirected cycle-free graph. As special cases, an empty graph, a single tree, and the discrete graph on a set of vertices (that is, the graph with these vertices that has no edges), all are examples of forests.

The term hedge sometimes refers to an ordered sequence of trees.

A polytree or oriented tree is a directed graph with at most one undirected path between any two vertices. In other words, a polytree is a directed acyclic graph for which there are no undirected cycles either.

A directed tree is a directed graph which would be a tree if the directions on the edges were ignored. Some authors restrict the phrase to the case where the edges are all directed towards a particular vertex, or all directed away from a particular vertex (see arborescence).

A tree is called a rooted tree if one vertex has been designated the root, in which case the edges have a natural orientation, towards or away from the root. The tree-order is the partial ordering on the vertices of a tree with u ≤ v if and only if the unique path from the root to v passes through u. A rooted tree which is a subgraph of some graph G is a normal tree if the ends of every edge in G are comparable in this tree-order whenever those ends are vertices of the tree. Rooted trees, often with additional structure such as ordering of the neighbors at each vertex, are a key data structure in computer science; see tree data structure. In a context where trees are supposed to have a root, a tree without any designated root is called a free tree.

In a rooted tree, the parent of a vertex is the vertex connected to it on the path to the root; every vertex except the root has a unique parent. A child of a vertex v is a vertex of which v is the parent.

A labeled tree is a tree in which each vertex is given a unique label. The vertices of a labeled tree on n vertices are typically given the labels 1, 2, …, n. A recursive tree is a labeled rooted tree where the vertex labels respect the tree order (i.e., if u < v for two vertices u and v, then the label of u is smaller than the label of v).

An n-ary tree is a rooted tree for which each vertex has at most n children. 2-ary trees are sometimes called binary trees, while 3-ary trees are sometimes called ternary trees.

A terminal vertex of a tree is a vertex of degree 1. In a rooted tree, the leaves are all terminal vertices; additionally, the root, if not a leaf itself, is a terminal vertex if it has precisely one child.

Plane Tree
An  or plane tree is a rooted tree for which an ordering is specified for the children of each vertex. This is called a "plane tree" because an ordering of the children is equivalent to an embedding of the tree in the plane (up to homotopy through embeddings or ambient isotopy). Given an embedding of a rooted tree in the plane, if one fixes a direction of children (starting from root, then first child, second child, etc.), say counterclockwise, then an embedding gives an ordering of the children. Conversely, given an ordered tree, and conventionally draw the root at the top, then the child nodes in an ordered tree can be drawn left-to-right, yielding an essentially unique planar embedding (up to embedded homotopy, i.e., moving the edges and nodes without crossing).

An n-ary tree is a rooted tree for which each vertex has at most n children. 2-ary trees are sometimes called binary trees, while 3-ary trees are sometimes called ternary trees.

A terminal vertex of a tree is a vertex of degree 1. In a rooted tree, the leaves are all terminal vertices; additionally, the root, if not a leaf itself, is a terminal vertex if it has precisely one child.

Example
The example tree shown to the right has 6 vertices and 6 &minus; 1 = 5 edges. The unique simple path connecting the vertices 2 and 6 is 2-4-5-6.

Facts

 * Every tree is a bipartite graph and a median graph. Every tree with only countably many vertices is a planar graph.


 * Every connected graph G admits a spanning tree, which is a tree that contains every vertex of G and whose edges are edges of G.


 * Every connected graph with only countably many vertices admits a normal spanning tree.


 * There exist connected graphs with uncountably many vertices which do not admit a normal spanning tree.


 * Every finite tree with n vertices, with n > 1, has at least two terminal vertices (leaves). This minimal number of terminal vertices is characteristic of path graphs; the maximal number, n − 1, is attained by star graphs.


 * For any three vertices in a tree, the three paths between them have exactly one vertex in common.

Labeled trees
Cayley's formula states that there are nn&minus;2 trees on n labeled vertices. It can be proved by first showing that the number of trees with vertices 1,2,...,n, of degrees d1,d2,...,dn respectively, is the multinomial coefficient
 * $$ {n-2 \choose d_1-1, d_2-1, \ldots, d_n-1}.$$

An alternative proof uses Prüfer sequences.

Cayley's formula is the special case of complete graphs in a more general problem of counting spanning trees in an undirected graph, which is addressed by the matrix tree theorem. The similar problem of counting all the subtrees regardless of size has been shown to be #P-complete in the general case.

Unlabeled trees
Counting the number of unlabeled free trees is a harder problem. No closed formula for the number t(n) of trees with n vertices up to graph isomorphism is known. The first few values of t(n) are:
 * 1, 1, 1, 1, 2, 3, 6, 11, 23, 47, 106, 235, 551, 1301, 3159, ....

proved the asymptotic estimate:
 * $$ {t(n) \sim C \alpha^n n^{-5/2} \quad\text{as } n\to\infty,}$$

with C = 0.534949606… and α = 2.99557658565…. (Here, $$f \sim g$$ means that $$\lim_{n \to \infty} f/g = 1 $$.) This is a consequence of his asymptotic estimate for the number $$r(n)$$ of unlabeled rooted trees with n vertices:
 * $$r(n) \sim D\alpha^n n^{-3/2} \quad\text{as } n\to\infty,$$

with D = 0.43992401257… and α the same as above (cf., Chap. 2.3.4.4 and , Chap. VII.5).

Types of trees
A star graph is a tree which consists of a single internal vertex (and n &minus; 1 leaves). In other words, a star graph of order n is a tree of order n with as many leaves as possible. Its diameter is at most 2.

A tree with two leaves (the fewest possible) is a path graph. If all vertices in a tree are within distance one of a central path subgraph, then the tree is a caterpillar tree. If all vertices are within distance two of a central path subgraph, then the tree is a lobster.