An asymptotic property of the number of spanning trees of double fixed step loop networks

DOI10.1007/s11766-997-0024-9zbMath0880.05027OpenAlexW69426363MaRDI QIDQ1364896

Xue-rong Yong, Fu Ji Zhang

Publication date: 28 August 1997

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-997-0024-9

zbMATH Keywords

circulant graphnumber of spanning trees

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Paths and cycles (05C38)

Related Items (2)

Counting the number of spanning trees in a class of double fixed-step loop networks ⋮ Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: An asymptotic property of the number of spanning trees of double fixed step loop networks