On the number of spanning trees of circulant graphs

DOI10.1080/00207168408803440zbMath0554.05019OpenAlexW1969576634MaRDI QIDQ3216668

No author found.

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

circulant graphspanning trees

Mathematics Subject Classification ID

Trees (05C05)

Related Items (10)

Heuristic maximization of the number of spanning trees in regular graphs ⋮ Multiplicative circulant networks. Topological properties and communication algorithms ⋮ The number of spanning trees of the generalized Boolean \(n\)-cube network ⋮ Maximizing the number of spanning trees of networks based on cycle basis representation ⋮ Max-cut in circulant graphs ⋮ The number of spanning trees of the generalized hypercube network ⋮ Maximizing the number of spanning trees of networks based on cycle basis representation ⋮ Counting trees in directed regular multigraphs ⋮ The number of spanning trees in a prism ⋮ The number of spanning trees of the regular networks

Cites Work

• Isomorphism of circulant graphs and digraphs
• Connectivity of transitive graphs
• Graphs with circulant adjacency matrices
• An algebraic characterization of symmetric graphs with a prime number of vertices
• THE MAXIMUM CONNECTIVITY OF A GRAPH
• Reliable circuits using less reliable relays
• Unnamed Item

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