On the asymptotic behavior of the maximum number of spanning trees in circulant graphs

DOI10.1002/(SICI)1097-0037(199708)30:1%3C47::AID-NET6%3E3.0.CO;2-LzbMATH Open0882.05073OpenAlexW2017241519MaRDI QIDQ4355485FDOQ4355485

Authors: Zbigniew Lonc, Krzysztof Parol, Jacek Wojciechowski 

Publication date: 21 September 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199708)30:1%3C47::aid-net6%3E3.0.co;2-l

Recommendations

• The asymptotic number of spanning trees in circulant graphs (extended abstract)
• On the number of spanning trees in directed circulant graphs
• The asymptotic number of spanning trees in circulant graphs
• The formulas for the number of spanning trees in circulant graphs
• The numbers of spanning trees in undirected circulant graphs

zbMATH Keywords

circulant graphsmaximum number of spanning trees

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Cited In (9)

• The asymptotic number of spanning trees in circulant graphs (extended abstract)
• Title not available (Why is that?)
• The asymptotic number of spanning trees in circulant graphs
• Heuristic maximization of the number of spanning trees in regular graphs
• A new technique for the characterization of graphs with a maximum number of spanning trees
• On the number of spanning trees in directed circulant graphs
• Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result
• The formulas for the number of spanning trees in circulant graphs
• The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic

This page was built for publication: On the asymptotic behavior of the maximum number of spanning trees in circulant graphs

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