Cayley’s formula And Prüfer sequences
Cayley 公式和 Prüfer 序列
Cayley 公式
公式内容
In mathematics, Cayley’s formula is a result in graph theory named after Arthur Cayley.
It states that for every positive integer n, the number of trees on n labeled vertices is $n^{n - 2}$
The formula equivalently counts the number of spanning trees of a complete graph with labeled vertices
(sequence A000272 in the OEIS).
上述描述来自 维基百科