English

Express the number of spanning trees in term of degrees

Combinatorics 2021-10-13 v3

Abstract

It is well-known that the number of spanning trees, denoted by τ(G)\tau(G), in a connected multi-graph GG can be calculated by the Matrix-Tree theorem and Tutte's deletion-contraction theorem. In this short note, we find an alternate method to compute τ(G)\tau(G) by degrees of vertices.

Keywords

Cite

@article{arxiv.2106.07871,
  title  = {Express the number of spanning trees in term of degrees},
  author = {Fengming Dong and Jun Ge and Zhangdong Ouyang},
  journal= {arXiv preprint arXiv:2106.07871},
  year   = {2021}
}

Comments

9 pages, 2 figures