The formulas for the number of spanning trees in circulant graphs
From MaRDI portal
Publication:2352053
DOI10.1016/j.disc.2015.04.025zbMath1315.05033OpenAlexW641452789MaRDI QIDQ2352053
Min Li, Zhibing Chen, Xiaoqing Ruan, Xue-rong Yong
Publication date: 29 June 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2015.04.025
Related Items (2)
Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics ⋮ On two conjectures concerning spanning tree edge dependences of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The number of spanning trees in directed circulant graphs with non-fixed jumps
- The asymptotic number of spanning trees in circulant graphs
- Spanning tree formulas and Chebyshev polynomials
- Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs
- The numbers of spanning trees of the cubic cycle \(C_ n^ 3\) and the quadruple cycle \(C_ n^ 4\)
- The number of spanning trees in circulant graphs
- Chebyshev polynomials and spanning tree formulas for circulant and related graphs
- On the number of spanning trees in directed circulant graphs
- On the asymptotic behavior of the maximum number of spanning trees in circulant graphs
- Asymptotic Enumeration of Spanning Trees
This page was built for publication: The formulas for the number of spanning trees in circulant graphs