Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs
The authors established asymptotic formulas for the number of spanning trees and the number of Eulerian trails in circulant digraphs and in circulant graphs. In particular, if \(T\) is the number of spanning trees and \(E\) is the number of Eulerian trails in any circulant digraph with \(p\) vertices and out-degree \(k\) then it is shown that \({1\over k}[T]^{{1\over p}}\sim 1\) and \({1\over k!}[E]^{{1\over p}}\sim 1\) for \(p\to\infty\). Additional results are established for line graphs and for circulant graphs.
- 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
- 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
- scientific article; zbMATH DE number 3445421 (Why is no real title available?)
- scientific article; zbMATH DE number 3363588 (Why is no real title available?)
- 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
- On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs
- On a formula for the number of Euler trails for a class of digraphs
- Complexity of graphs generated by wheel graph and their asymptotic limits
- The number of spanning trees in odd valent circulant graphs
- An alternative formula for the number of Euler trails for a class of digraphs
- Number of spanning trees in the sequence of some graphs
- The complexity of some classes of pyramid graphs created from a gear graph
- The formulas for the number of spanning trees in circulant graphs
- Norm estimates of -circulant operator matrices and isomorphic operators for -circulant algebra
- scientific article; zbMATH DE number 1827742 (Why is no real title available?)
- Complexity of circulant graphs with non-fixed jumps, its arithmetic properties and asymptotics
- Asymptotic enumeration of Eulerian circuits in graphs with strong mixing properties
- Counting spanning trees of (1, N)-periodic graphs
- Asymptotic behaviour of the number of Eulerian circuits
- The number of spanning trees for Sierpiński graphs and data center networks
- On the number of spanning trees and Eulerian tours in iterated line digraphs
- The asymptotic numbers of regular tournaments, Eulerian digraphs and Eulerian oriented graphs
- 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
- The asymptotic number of spanning trees in circulant graphs
- An efficient approach for counting the number of spanning trees in circulant and related graphs
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)
