On the number of spanning trees of circulant graphs

DOI10.1080/00207168408803440zbMATH Open0554.05019OpenAlexW1969576634MaRDI QIDQ3216668FDOQ3216668

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

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

zbMATH Keywords

spanning treescirculant graph

Mathematics Subject Classification ID

Trees (05C05)

Cites Work

• Reliable circuits using less reliable relays
• Isomorphism of circulant graphs and digraphs
• Graphs with circulant adjacency matrices
• Connectivity of transitive graphs
• THE MAXIMUM CONNECTIVITY OF A GRAPH
• An algebraic characterization of symmetric graphs with a prime number of vertices
• Title not available (Why is that?)

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
• Title not available (Why is that?)
• Coding and counting spanning trees in Kleitman-Golden graphs
• Formulas for the number of spanning trees in a fan
• Counting spanning trees of \((1, N\))-periodic graphs
• The number of spanning trees in a prism
• 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)
• On Rationality of Generating Function for the Number of Spanning Trees in Circulant Graphs
• Spanning trees in directed circulant graphs and cycle power graphs
• Multiplicative circulant networks. Topological properties and communication algorithms
• Title not available (Why is that?)
• 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)