On the number of spanning trees in directed circulant graphs

DOI10.1002/net.2zbMath0974.05043OpenAlexW2127340552MaRDI QIDQ2719844

Zbigniew Lonc, Krzysztof Parol, Jacek M. Wojciechowski

Publication date: 26 June 2001

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.2

zbMATH Keywords

network reliabilityspanning treesdirected circulant graphs

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Applications of graph theory to circuits and networks (94C15)

Related Items (8)

Counting the number of spanning trees in a class of double fixed-step loop networks ⋮ Heuristic maximization of the number of spanning trees in regular graphs ⋮ On two conjectures concerning spanning tree edge dependences of graphs ⋮ 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 ⋮ The asymptotic number of spanning trees in circulant graphs ⋮ Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs ⋮ The formulas for the number of spanning trees in circulant graphs

Cites Work

• Counting trees in directed regular multigraphs
• Spanning trees in regular graphs
• Spanning tree formulas and Chebyshev polynomials
• Super Line-Connectivity Properties of Circulant Graphs
• On the asymptotic behavior of the maximum number of spanning trees in circulant graphs

This page was built for publication: On the number of spanning trees in directed circulant graphs