The number of spanning trees in odd valent circulant graphs

DOI10.1016/j.disc.2003.12.006zbMath1042.05051OpenAlexW2020042726WikidataQ114190813 ScholiaQ114190813MaRDI QIDQ1827730

Qiuying Lin, Fu Ji Zhang, Xie-Bin Chen

Publication date: 6 August 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2003.12.006

zbMATH Keywords

Asymptotic behaviorSpanning treeCirculant graphLinear recurrence relation

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30)

Related Items (21)

Counting spanning trees in cobordism of two circulant graphs ⋮ On Jacobian group and complexity of the generalized Petersen graph \(\mathrm{GP}(n,k)\) through Chebyshev polynomials ⋮ The number of rooted forests in circulant graphs ⋮ Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics ⋮ The Enumeration of Spanning Trees in Dual, Bipartite and Reduced Graphs ⋮ On the structure of the Jacobian group for circulant graphs ⋮ Further analysis of the number of spanning trees in circulant graphs ⋮ The number of spanning trees in directed circulant graphs with non-fixed jumps ⋮ Counting rooted spanning forests for circulant foliation over a graph ⋮ On two conjectures concerning spanning tree edge dependences of graphs ⋮ Counting spanning trees of \((1, N\))-periodic graphs ⋮ Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians ⋮ 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 ⋮ On Jacobian group and complexity of I-graph I(n, k, l) through Chebyshev polynomials ⋮ Spanning trees: A survey ⋮ The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic ⋮ An efficient approach for counting the number of spanning trees in circulant and related graphs ⋮ Complexity of the circulant foliation over a graph ⋮ Asymptotics and arithmetical properties of complexity for circulant graphs ⋮ Counting rooted spanning forests in cobordism of two circulant graphs

Cites Work

• Spanning tree formulas and Chebyshev polynomials
• Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs
• Laplacian matrices of graphs: A survey
• 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
• Counting Trees in a Certain Class of Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: The number of spanning trees in odd valent circulant graphs