CountingSpanningTrees.pptVIP

Kun-Mao Chao Counting Spanning Trees Kun-Mao Chao (趙坤茂) Department of Computer Science and Information Engineering National Taiwan University, Taiwan E-mail: kmchao@.tw WWW: .tw/~kmchao Spanning Trees A spanning tree for a graph G is a subgraph of G that is a tree and contains all the vertices of G. All 16 spanning trees of K4 Cayley’s formula Back in 1889, Cayley devised the well-known formula nn-2 for the number of spanning trees in the complete graph Kn The first explicit combinatorial proof of Cayleys formula is due to Pr\{u}fer. Pr\{u}fer sequence A Pr\{u}fer sequence of length n-2, for