The number of spanning trees in directed circulant graphs with non-fixed jumps

DOI10.1016/J.DISC.2006.09.034zbMath1143.05041OpenAlexW2022506535MaRDI QIDQ882110

Xie-Bin Chen

Publication date: 23 May 2007

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

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

zbMATH Keywords

asymptotic behaviorspanning treelinear recurrence relationdirected circulant graph

Mathematics Subject Classification ID

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

Related Items (6)

Counting the number of spanning trees in a class of double fixed-step loop networks ⋮ The number of spanning trees of the Cartesian product of regular graphs ⋮ Spanning trees in directed circulant graphs and cycle power graphs ⋮ The asymptotic number of spanning trees in circulant graphs ⋮ An efficient approach for counting the number of spanning trees in circulant and related graphs ⋮ The formulas for the number of spanning trees in 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
• 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
• Unnamed Item
• Unnamed Item

This page was built for publication: The number of spanning trees in directed circulant graphs with non-fixed jumps