An efficient approach for counting the number of spanning trees in circulant and related graphs
From MaRDI portal
Publication:966019
DOI10.1016/j.disc.2009.11.033zbMath1230.05097OpenAlexW2072070879MaRDI QIDQ966019
Hiroshi Inaba, Talip Atajan, Xue-rong Yong
Publication date: 27 April 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.11.033
Related Items (4)
Asymptotics for the number of spanning trees in circulant graphs and degenerating \(d\)-dimensional discrete tori ⋮ Counting spanning trees using modular decomposition ⋮ Critical groups of graphs with dihedral actions ⋮ Counting Spanning Trees in Graphs Using Modular Decomposition
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The number of spanning trees in \(K_ n\)-complements of quasi-threshold graphs
- Counting the number of spanning trees in a class of double fixed-step loop networks
- Further analysis of the number of spanning trees in circulant graphs
- The number of spanning trees in directed circulant graphs with non-fixed jumps
- Laplacian spectrum of weakly quasi-threshold graphs
- Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs
- Counting spanning trees in the graphs of Kleitman and Golden and a generalization
- Spanning tree formulas and Chebyshev polynomials
- Tree counting polynomials for labelled graphs. I: Properties
- Distributed loop network with minimum transmission delay
- 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
- Chebyshev polynomials and spanning tree formulas for circulant and related graphs
- The number of spanning trees in a class of double fixed-step loop networks
- Counting Trees in a Certain Class of Graphs
- Maximizing spanning trees in almost complete graphs
- Algorithms and Computation
This page was built for publication: An efficient approach for counting the number of spanning trees in circulant and related graphs
