Repository logo
  • Log In
Repository logo
  • Log In
  1. Home
  2. NIE Publications & Research Output
  3. Electronic Academic Papers
  4. Journal Articles
  5. Express the number of spanning trees in term of degrees
 
  • Details
Options

Express the number of spanning trees in term of degrees

URI
https://hdl.handle.net/10497/23452
Loading...
Thumbnail Image
Type
Article
Files
 AMC-415-126697.pdf (182.53 KB)
Citation
Dong, F., Ge, J., & Ouyang, Z. (2022). Express the number of spanning trees in term of degrees. Applied Mathematics and Computation, 415, Article 126697. https://doi.org/10.1016/j.amc.2021.126697
Author
Dong, F. M. 
•
Ge, Jun
•
Ouyang, Zhangdong
Abstract
It is well-known that the number of spanning trees, denoted by т(G) , in a connected multi-graph G can be calculated by the Matrix-Tree Theorem and Tutte’s deletion-contraction formula. In this short note, we find an alternate method to compute т(G) by degrees of vertices.
Keywords
  • Spanning tree

  • Degree

  • Graph polynomial

Date Issued
2022
Publisher
Elsevier
Journal
Applied Mathematics and Computation
DOI
10.1016/j.amc.2021.126697
  • Contact US
  • Terms of Use
  • Privacy Policy

NTU Reg No: 200604393R. Copyright National Institute of Education, Nanyang Technological University (NIE NTU), Singapore

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science