Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs

DOI10.1007/BF02879060MaRDI QIDQ1297626zbMATHFDO

Authors Fuji Zhang, Xuerong Yong

Publication date 25 January 2000

Published in Science in China. Series A (Search for Journal in Brave)

zbMATH Keywords

asymptotic formulasline graphscirculant graphscirculant digraphsnumber of spanning treesnumber of Eulerian trails

Mathematics Subject Classification ID

Trees (05C05) Eulerian and Hamiltonian graphs (05C45) Asymptotic enumeration (05A16) Enumeration in graph theory (05C30)

Recommendations

• The asymptotic number of spanning trees in circulant graphs (extended abstract)
• The asymptotic number of spanning trees in circulant graphs
• The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic
• The formulas for the number of spanning trees in circulant graphs
• On the asymptotic behavior of the maximum number of spanning trees in circulant graphs

Cites work

• scientific article; zbMATH DE number 3445421 (Why is no real title available?)
• scientific article; zbMATH DE number 3363588 (Why is no real title available?)
• A Combinatorial Problem Related to Multimodule Memory Organizations
• A Design for Directed Graphs with Minimum Diameter
• An Algorithm for Non-Linear Network Programming: Implementation, Results and Comparisons
• An asymptotic property of the number of spanning trees of double fixed step loop networks
• Design to Minimize Diameter on Building-Block Network
• Line Digraph Iterations and the (d, k) Digraph Problem
• Matching theory
• Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
• On the number of spanning trees and Eulerian tours in iterated line digraphs
• On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs
• Roots and Canonical Forms for Circulant Matrices

Cited in

(21)

• An efficient approach for counting the number of spanning trees in circulant and related graphs
• Counting spanning trees of \((1, N\))-periodic graphs
• Counting the number of spanning trees in a class of double fixed-step loop networks
• The complexity of some classes of pyramid graphs created from a gear graph
• Norm estimates of \(\omega\)-circulant operator matrices and isomorphic operators for \(\omega\)-circulant algebra
• Complexity of graphs generated by wheel graph and their asymptotic limits
• Further analysis of the number of spanning trees in circulant graphs
• The asymptotic number of spanning trees in circulant graphs
• On the number of spanning trees and Eulerian tours in iterated line digraphs
• The number of spanning trees for Sierpiński graphs and data center networks
• The formulas for the number of spanning trees in circulant graphs
• The number of spanning trees in directed circulant graphs with non-fixed jumps
• Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics
• An alternative formula for the number of Euler trails for a class of digraphs
• Asymptotic behaviour of the number of Eulerian circuits
• On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs
• Asymptotic enumeration of Eulerian circuits in graphs with strong mixing properties
• Number of spanning trees in the sequence of some graphs
• The number of spanning trees in odd valent circulant graphs
• On a formula for the number of Euler trails for a class of digraphs
• scientific article; zbMATH DE number 1827742 (Why is no real title available?)

This page was built for publication: Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs

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