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

DOI10.1016/J.AML.2009.04.006MaRDI QIDQ847313zbMATH OpenOpenAlexFDO

Authors Talip Atajan, Naohisa Otsuka, Xuerong 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) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Network design and communication in computer systems (68M10)

Recommendations

• The spanning trees formulas in a class of double fixed-step loop networks (extended abstract)
• The number of spanning trees in a class of double fixed-step loop networks
• The number of spanning trees of three special double fixed step loop networks
• The number of spanning trees in directed circulant graphs with non-fixed jumps
• A formula for the number of spanning trees in circulant graphs with nonfixed generators and discrete tori

Cites work

• scientific article; zbMATH DE number 3941580 (Why is no real title available?)
• scientific article; zbMATH DE number 815575 (Why is no real title available?)
• An asymptotic property of the number of spanning trees of double fixed step loop networks
• Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs
• Counting spanning trees in the graphs of Kleitman and Golden and a generalization
• Counting the number of spanning trees in a class of double fixed-step loop networks
• Distributed loop network with minimum transmission delay
• Further analysis of 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
• The number of spanning trees in circulant graphs
• The number of spanning trees in directed circulant graphs with non-fixed jumps
• The numbers of spanning trees of the cubic cycle \(C_ n^ 3\) and the quadruple cycle \(C_ n^ 4\)

Cited in

(8)

• The number of spanning trees of three special double fixed step loop networks
• The number of spanning trees in a class of double fixed-step loop networks
• An efficient approach for counting the number of spanning trees in circulant and related graphs
• Enumeration of spanning trees of 2-separable networks
• 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: Counting 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 Q847313)