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

DOI10.1016/J.AML.2009.04.006zbMath1202.05062OpenAlexW1972943602MaRDI QIDQ847313

Naohisa Otsuka, Talip Atajan, Xue-rong Yong

Publication date: 12 February 2010

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2009.04.006

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30)

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

• Unnamed Item
• Unnamed Item
• Counting the number of spanning trees in a class of double fixed-step loop networks
• 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 spanning trees in the graphs of Kleitman and Golden and a generalization
• Distributed loop network with minimum transmission delay
• Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs
• The numbers of spanning trees of the cubic cycle \(C_ n^ 3\) and the quadruple cycle \(C_ n^ 4\)
• An asymptotic property of the number of spanning trees of double fixed step loop networks
• The number of spanning trees in circulant graphs
• On the number of spanning trees in directed circulant graphs
• The number of spanning trees in a class of double fixed-step loop networks

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