Graph enumeration

The complete list of all free trees on 2, 3, and 4 labeled vertices: ${\displaystyle 2^{2-2}=1}$ tree with 2 vertices, ${\displaystyle 3^{3-2}=3}$ trees with 3 vertices, and ${\displaystyle 4^{4-2}=16}$ trees with 4 vertices.

In combinatorics, an area of mathematics, graph enumeration describes a class of combinatorial enumeration problems in which one must count undirected or directed graphs of certain types, typically as a function of the number of vertices of the graph.^[1] These problems may be solved either exactly (as an algebraic enumeration problem) or asymptotically. The pioneers in this area of mathematics were George Pólya,^[2] Arthur Cayley^[3] and J. Howard Redfield.^[4]

Labeled vs unlabeled problems[]

In some graphical enumeration problems, the vertices of the graph are considered to be labeled in such a way as to be distinguishable from each other, while in other problems any permutation of the vertices is considered to form the same graph, so the vertices are considered identical or unlabeled. In general, labeled problems tend to be easier.^[5] As with combinatorial enumeration more generally, the Pólya enumeration theorem is an important tool for reducing unlabeled problems to labeled ones: each unlabeled class is considered as a symmetry class of labeled objects.

Exact enumeration formulas[]

Some important results in this area include the following.

• The number of labeled n-vertex simple undirected graphs is 2^{n(n −1)/2}.^[6]
• The number of labeled n-vertex simple directed graphs is 2^n(n −1).^[7]
• The number C_n of connected labeled n-vertex undirected graphs satisfies the recurrence relation^[8]

${\displaystyle C_{n}=2^{n \choose 2}-{\frac {1}{n}}\sum _{k=1}^{n-1}k{n \choose k}2^{n-k \choose 2}C_{k}.}$

from which one may easily calculate, for n = 1, 2, 3, ..., that the values for C_n are

1, 1, 4, 38, 728, 26704, 1866256, ...(sequence A001187 in the OEIS)

• The number of labeled n-vertex free trees is nⁿ⁻² (Cayley's formula).
• The number of unlabeled n-vertex caterpillars is^[9]

${\displaystyle 2^{n-4}+2^{\lfloor (n-4)/2\rfloor }.}$

Graph database[]

Various research groups have provided searchable database that lists graphs with certain properties of a small sizes. For example

• The House of Graphs
• Small Graph Database

References[]