DMAT_L7

Cayley’s theorem

Definition 1(Tree).

A tree is a minimally connected graph.

Definition 2(Cycle).

A cycle is a sequence of distinct vertices $u_1,u_2,\dots u_k$ where $\{u_i,u_{i+1}\}\in E$ for all $1\le i\le k-1$ and $\{u_k,u_1\}\in E$.

Theorem 3(Theorem).

A tree is a connected graph without cycles.

Theorem 4(Cayley's Theorem).

The number of labelled trees on $n$ vertices is $n^{n-2}$.

Refer Cameron.

Alternate proof exists using Prüfer sequences.