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

DOI10.1002/NET.20223MaRDI QIDQ3528151zbMATH OpenOpenAlexFDO

Authors Yuanping Zhang, Xuerong Yong, Mordecai J. Golin

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 treedouble loop networkmatrix tree theoremcirculant digraphstep double loop networkstep loop network

Mathematics Subject Classification ID

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

Recommendations

• Counting the number of spanning trees in a class of double fixed-step loop networks
• An asymptotic property of the number of spanning trees of double fixed step loop networks
• The number of spanning trees of three special double fixed step loop networks
• The spanning trees formulas in a class of double fixed-step loop networks (extended abstract)
• The number of spanning trees of double graphs
• The number of spanning trees of the regular networks
• The number of spanning tree in several classes of graphs
• The number of spanning trees in circulant graphs
• The number of spanning trees in some classes of graphs
• The number of spanning trees in Apollonian networks

Cites work

• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• scientific article; zbMATH DE number 3206571 (Why is no real title available?)
• Algorithms and Computation
• Counting spanning trees in the graphs of Kleitman and Golden and a generalization
• Fault-tolerant routings in double fixed-step networks
• On the number of spanning trees in directed circulant graphs
• Spanning tree formulas and Chebyshev polynomials
• The number of spanning trees in circulant graphs

Cited in

(7)

• The number of spanning trees of three special double fixed step loop networks
• An efficient approach for counting the number of spanning trees in circulant and related graphs
• New method for counting the number of spanning trees in a two-tree network
• Spanning trees in directed circulant graphs and cycle power graphs
• Counting the number of spanning trees in a class of double fixed-step loop networks
• The spanning trees formulas in a class of double fixed-step loop networks (extended abstract)
• The number of spanning trees of the Cartesian product of regular graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3528151)