Abstract
In this paper we obtain precise asymptotics for certain families of graphs, namely circulant graphs and degenerating discrete tori. The asymptotics contain interesting constants from number theory among which some can be interpreted as corresponding values for continuous limiting objects. We answer one question formulated in a paper from Atajan, Yong, and Inaba in [1] and formulate a conjecture in relation to the paper from Zhang, Yong, and Golin [23]. A crucial ingredient in the proof is to use the matrix tree theorem and express the combinatorial Laplacian determinant in terms of Bessel functions. A non-standard Poisson summation formula and limiting properties of theta functions are then used to evaluate the asymptotics.
Similar content being viewed by others
References
Atajan T., Yong X., Inaba H.: Further analysis of the number of spanning trees in circulant graphs. Discrete Math. 306(22), 2817–2827 (2006)
Atajan T., Yong X., Inaba H.: An efficient approach for counting the number of spanning trees in circulant and related graphs. Discrete Math. 310(67), 1210–1221 (2010)
Balachandran, P., Viles, W., Kolaczyk, E.D.: Exponentialtype inequalities involving ratios of the modified Bessel function of the first kind and their applications. Preprint, arXiv:1311.1450 (2013)
Baron G., Prodinger H., Tichy R.F., Boesch F.T., Wang J.F.: The number of spanning trees in the square of a cycle. Fibonacci Quart. 23(3), 258–264 (1985)
Boesch F.T., Prodinger H.: Spanning tree formulas and Chebyshev polynomials. Graphs Combin. 2, 191–200 (1986)
Chinta G., Jorgenson J., Karlsson A.: Zeta functions, heat kernels, and spectral asymptotics on degenerating families of discrete tori. Nagoya Math. J. 198, 121–172 (2010)
Chinta, G., Jorgenson, J., Karlsson, A.: Complexity and heights of tori. In: Bowen, L., Grigorchuk, R., Vorobets, Y. (eds.) Dynamical Systems and Group Actions, pp. 89–98. Amer. Math. Soc., Providence, RI (2012)
Cochran J.A.: The monotonicity of modified Bessel functions with respect to their order. J. Math. Phys. 46, 220–222 (1967)
Colbourn C.J.: The Combinatorics of Network Reliability. Oxford University Press, New York (1987)
Cvetković, D.M., Doob, M., Sachs, H.: Spectra of Graphs. Academic Press Inc., New York (1980)
Golin, M.J., Leung, Y.C.: Unhooking circulant graphs: a combinatorial method for counting spanning trees and other parameters. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) GraphTheoretic Concepts in Computer Science, pp. 296–307. Springer, Berlin (2004)
Golin, M.J., Leung, Y.C., Wang, Y.: Counting spanning trees and other structures in nonconstantjump circulant graphs. In: Fleischer, R., Trippen, G. (eds.) Algorithms and Computation, pp. 508–521. Springer, Berlin (2004)
Golin M.J., Yong X., Zhang Y.: The asymptotic number of spanning trees in circulant graphs. Discrete Math. 310(4), 792–803 (2010)
Karlsson, A., Neuhauser, M.: Heat kernels, theta identities, and zeta functions on cyclic groups. In: Grigorchuk, R., Mihalik, M., Sapir, M., Šuniḱ, Z. (eds.) Topological and Asymptotic Aspects of Group Theory, pp. 177–189. Amer. Math. Soc., Providence, RI (2006)
Kirchhoff G.: Ueber die Auflösung der Gleichungen, auf welche man bei der Untersuchung der linearen Vertheilung galvanischer Ströme geführt wird. Ann. Phys. 148(12), 497–508 (1847)
Kleitman D.J., Golden B.: Counting trees in a certain class of graphs. Amer. Math. Monthly 82, 40–44 (1975)
Korsch H.J., Klumpp A., Witthaut D.: On two-dimensional Bessel functions. J. Phys. A 39(48), 14947–14964 (2006)
McDonald L.M., Moffatt I.: On the Potts model partition function in an external field. J. Stat. Phys. 146(6), 1288–1302 (2012)
Voros A.: Spectral functions, special functions and the Selberg zeta function. Comm. Math. Phys. 110(3), 439–465 (1987)
Yong X., Talip A.: The numbers of spanning trees of the cubic cycle \({C_N^3}\) and the quadruple cycle \({C_N^4}\) . Discrete Math. 169(1-3), 293–298 (1997)
Zhang, Y., Golin, M.J.: Further applications of Chebyshev polynomials in the derivation of spanning tree formulas for circulant graphs. In: Chauvin, B., Flajolet, P., Gardy, D., Mokkadem, A. (eds.) Mathematics and Computer Science, II, pp. 541–553. Birkhäuser, Basel (2002)
Zhang Y., Yong X., Golin M.J.: The number of spanning trees in circulant graphs. Discrete Math. 223(1-3), 337–350 (2000)
Zhang Y., Yong X., Golin M.J.: Chebyshev polynomials and spanning tree formulas for circulant and related graphs. Discrete Math. 298(1-3), 334–364 (2005)
Author information
Authors and Affiliations
Corresponding author
Additional information
The author acknowledges support from the Swiss NSF grant 200021_132528/1.
Rights and permissions
About this article
Cite this article
Louis, J. Asymptotics for the Number of Spanning Trees in Circulant Graphs and Degenerating d-Dimensional Discrete Tori. Ann. Comb. 19, 513–543 (2015). https://doi.org/10.1007/s00026-015-0272-y
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00026-015-0272-y