On the asymptotic behavior of the maximum number of spanning trees in circulant graphs
From MaRDI portal
Publication:4355485
DOI<47::AID-NET6>3.0.CO;2-L 10.1002/(SICI)1097-0037(199708)30:1<47::AID-NET6>3.0.CO;2-LzbMath0882.05073OpenAlexW2017241519MaRDI QIDQ4355485
Krzysztof Parol, Zbigniew Lonc, Jacek M. Wojciechowski
Publication date: 21 September 1997
Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199708)30:1<47::aid-net6>3.0.co;2-l
Trees (05C05) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30)
Related Items (4)
Heuristic maximization of the number of spanning trees in regular graphs ⋮ 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
This page was built for publication: On the asymptotic behavior of the maximum number of spanning trees in circulant graphs