The number of spanning trees in a class of double fixed-step loop networks

DOI10.1002/net.20223zbMath1155.05032OpenAlexW4237598401MaRDI QIDQ3528151

Yuanping Zhang, Mordecai J. Golin, Xue-rong Yong

Publication date: 8 October 2008

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

spanning treecirculant digraphdouble loop networkmatrix tree theoremstep double loop networkstep loop network

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

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 ⋮ An efficient approach for counting the number of spanning trees in circulant and related graphs

Cites Work

• Counting spanning trees in the graphs of Kleitman and Golden and a generalization
• Spanning tree formulas and Chebyshev polynomials
• Fault-tolerant routings in double fixed-step networks
• The number of spanning trees in circulant graphs
• On the number of spanning trees in directed circulant graphs
• Algorithms and Computation
• Unnamed Item
• Unnamed Item

This page was built for publication: The number of spanning trees in a class of double fixed-step loop networks