Further analysis of the number of spanning trees in circulant graphs
From MaRDI portal
Publication:860448
DOI10.1016/j.disc.2006.05.024zbMath1131.05048OpenAlexW2121225779MaRDI QIDQ860448
Hiroshi Inaba, Talip Atajan, Xue-rong Yong
Publication date: 9 January 2007
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2006.05.024
Related Items (9)
Counting the number of spanning trees in a class of double fixed-step loop networks ⋮ Asymptotics for the number of spanning trees in circulant graphs and degenerating \(d\)-dimensional discrete tori ⋮ Counting spanning trees of \((1, N\))-periodic graphs ⋮ Spectra of subdivision-vertex join and subdivision-edge join of two graphs ⋮ The number of spanning trees of the Cartesian product of regular graphs ⋮ Number of spanning trees of different products of complete and complete bipartite graphs ⋮ Spanning trees: A survey ⋮ Spanning trees in directed circulant graphs and cycle power graphs ⋮ An efficient approach for counting the number of spanning trees in circulant and related graphs
Cites Work
- Spanning tree formulas and Chebyshev polynomials
- The Fibonacci numbers via trigonometric expressions
- Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs
- Parallel concepts in graph theory
- 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
- The number of spanning trees in odd valent circulant graphs
- Counting Trees in a Certain Class of Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Further analysis of the number of spanning trees in circulant graphs
