On the number of spanning trees of circulant graphs

DOI10.1080/00207168408803440MaRDI QIDQ3216668zbMATH OpenOpenAlexFDO

Authors

Publication date 1984

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207168408803440

zbMATH Keywords

spanning treescirculant graph

Mathematics Subject Classification ID

Trees (05C05)

Recommendations

• The numbers of spanning trees in undirected circulant graphs
• The numbers of spanning trees of some families of circulant graphs
• The number of spanning trees in circulant graphs
• scientific article; zbMATH DE number 140113
• The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic

Cites work

• scientific article; zbMATH DE number 3458684 (Why is no real title available?)
• An algebraic characterization of symmetric graphs with a prime number of vertices
• Connectivity of transitive graphs
• Graphs with circulant adjacency matrices
• Isomorphism of circulant graphs and digraphs
• Reliable circuits using less reliable relays
• THE MAXIMUM CONNECTIVITY OF A GRAPH

Cited in

(27)

• Spanning forests and the golden ratio
• The number of spanning trees in a superprism
• On the number of spanning trees and Eulerian tours in iterated line digraphs
• The number of spanning trees of the regular networks
• Chebyshev polynomials and spanning tree formulas for circulant and related graphs
• Maximizing the number of spanning trees of networks based on cycle basis representation
• The number of spanning trees of the generalized Boolean \(n\)-cube network
• Heuristic maximization of the number of spanning trees in regular graphs
• The numbers of spanning trees in undirected circulant graphs
• On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs
• scientific article; zbMATH DE number 140113 (Why is no real title available?)
• Coding and counting spanning trees in Kleitman-Golden graphs
• Formulas for the number of spanning trees in a fan
• The number of spanning trees in a prism
• Counting spanning trees of \((1, N\))-periodic graphs
• Max-cut in circulant graphs
• Counting trees in directed regular multigraphs
• Maximizing the number of spanning trees of networks based on cycle basis representation
• On a conjecture concerning spanning tree invariants and loop systems
• The number of spanning trees of the generalized hypercube network
• CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2^m, 2)
• Spanning trees in directed circulant graphs and cycle power graphs
• On Rationality of Generating Function for the Number of Spanning Trees in Circulant Graphs
• Multiplicative circulant networks. Topological properties and communication algorithms
• scientific article; zbMATH DE number 3941580 (Why is no real title available?)
• The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic
• The number of spanning trees in odd valent circulant graphs

This page was built for publication: On the number of spanning trees of circulant graphs

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