×

The asymptotic number of spanning trees in circulant graphs. (English) Zbl 1205.05108

Summary: Let \(T(G)\) be the number of spanning trees in graph \(G\). In this note, we explore the asymptotics of \(T(G)\) when \(G\) is a circulant graph with given jumps.
The circulant graph \(C_n^{s_1,s_2,\dots,s_k}\) is the \(2k\)-regular graph with \(n\) vertices labeled \(0,1,2,\dots,n-1\), where node \(i\) has the \(2k\) neighbors \(i\pm s_1,i\pm s_2,\dots,i\pm s_k\) where all the operations are \(\pmod n\). We give a closed formula for the asymptotic limit \(\lim_{n\to\infty} T(C_n^{s_1,s_2,\dots,s_k})^{\frac1n}\) as a function of \(s_1,s_2,\dots,s_k\). We then extend this by permitting some of the jumps to be linear functions of \(n\), i.e., letting \(s_i\), \(d_i\) and \(e_i\) be arbitrary integers, and examining
\[ \lim_{n\to\infty} T\left(C_n^{s_1,s_2,\dots,s_k,\lfloor\frac{n}{d_1}\rfloor+ e_1,\lfloor \frac{n}{d_2}\rfloor+ e_2,\dots, \lfloor\frac{n}{d_l}\rfloor+e_l}\right)^{\frac1n}. \]
While this limit does not usually exist, we show that there is some \(p\) such that for \(0\leq q<p\), there exists \(c_q\) such that limit (1) restricted to only \(n\) congruent to \(q\) modulo \(p\) does exist and is equal to \(c_q\). We also give a closed formula for \(c_q\).
One further consequence of our derivation is that if \(s_i\) go to infinity (in any arbitrary order), then
\[ \lim_{s_1,s_2,\dots,s_k\to\infty}\;\lim_{n\to\infty} T(C_n^{2_1,s_2,\dots,s_k})^{\frac1n}= 4\exp \left[ \int_0^1 \int_0^1\cdots \int_0^1 \ln\bigg(\sum_{i=1}^k \sin^2\pi x_i\bigg)\, dx_1dx_2\cdots dx_k\right]. \]
Interestingly, this value is the same as the asymptotic number of spanning trees in the \(k\)-dimensional square lattice recently obtained by Garcia, Noy and Tejel.

MSC:

05C30 Enumeration in graph theory
05C05 Trees
Full Text: DOI

References:

[1] Abramowitz, M.; Stegun, I. A., Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables (1964), U.S. National Bureau of Standards: U.S. National Bureau of Standards Washington D.C · Zbl 0171.38503
[2] Bedrosian, S. D., Tree counting polynomials for labelled graphs, J. Franklin Inst., 312, 417-430 (1981) · Zbl 0477.05046
[3] Biggs, N., Algebraic Graph Theory (1993), Cambridge University Press: Cambridge University Press London
[4] Boesch, F. T.; Prodinger, H., Spanning tree formulas and Chebyshev polynomials, Graphs Combin., 2, 191-200 (1986) · Zbl 0651.05028
[5] F.T. Boesch, J.F. Wang, A Conjecture on the number of spanning trees in the square of a cycle, in: Notes from New York Graph Theory Day V, 1982, page 16; F.T. Boesch, J.F. Wang, A Conjecture on the number of spanning trees in the square of a cycle, in: Notes from New York Graph Theory Day V, 1982, page 16
[6] Chen, X., An asymptotic enumeration theorem for the number of spanning trees in grids and tori (in Chinese), J. Zhangzhou Teach. Coll. Nat. Sci., 14, 2, 7-12 (2001) · Zbl 0989.05056
[7] Chen, X., The number of spanning trees in directed circulant graphs with non-fixed jumps, Discrete Math., 307, 1873-1880 (2007) · Zbl 1143.05041
[8] Cvetkovič, D.; Doob, M.; Sachs, H., Spectra of Graphs: Theory and Applications (1995), Johann Ambrosius Barth: Johann Ambrosius Barth Heidelberg · Zbl 0824.05046
[9] Garcia, A.; Noy, M.; Tejel, J., The asymptotic number of spanning trees in \(d\)-dimensional square lattices, J. Combin. Math. Combin. Comput., 44, 109-113 (2003) · Zbl 1029.05074
[10] M. Golin, Y. Leung, Y. Wang, X. Yong, Counting structures in grid graphs, cylinders and tori using transfer matrices: Survey and new results, in: The Proceedings of SIAM ALENEX/ANALCO (Workshop on Analytic Algorithms and Combinatorics), British Columbia, Canada, 2005; M. Golin, Y. Leung, Y. Wang, X. Yong, Counting structures in grid graphs, cylinders and tori using transfer matrices: Survey and new results, in: The Proceedings of SIAM ALENEX/ANALCO (Workshop on Analytic Algorithms and Combinatorics), British Columbia, Canada, 2005
[11] M.J. Golin, Y.C. Leung, Y.J. Wang, Counting spanning trees and other structures in non-constant jump circulant graphs, in: The 15th Annual International Symposium on Algorithms and Computation, 2004, pp. 508-521; M.J. Golin, Y.C. Leung, Y.J. Wang, Counting spanning trees and other structures in non-constant jump circulant graphs, in: The 15th Annual International Symposium on Algorithms and Computation, 2004, pp. 508-521 · Zbl 1116.05303
[12] Kirchhoff, G., Über die Auflösung der gleichungen, auf welche man bei der Untersuchung der linearen Verteilung galvanischer Ströme geführt wird, Ann. Phys. Chem., 72, 497-508 (1847)
[13] Lonc, Z.; Parol, K.; Wojciechowski, J. M., On the asymptotic behavior of the maximum number of spanning trees in circulant graphs, Networks, 30, 1, 47-56 (1997) · Zbl 0882.05073
[14] Lonc, Z.; Parol, K.; Wojciechowski, J. M., On the number of spanning trees in directed circulant graphs, Networks, 37, 3, 129-133 (2001) · Zbl 0974.05043
[15] Lyons, R., Asymptotic enumeration of spanning trees, Combin. Probab. Comput., 14, 4, 491-522 (2005) · Zbl 1076.05007
[16] Yong, X.; Talip; Acenjian, The numbers of spanning trees of the cubic cycle \(C_N^3\) and the quadruple cycle \(C_N^4\), Discrete Math., 169, 293-298 (1997) · Zbl 0879.05036
[17] Zhang, F.; Yong, X., Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs & graphs, Sci. China Ser. A, 43, 3, 264-271 (1999) · Zbl 0929.05018
[18] Zhang, Y.; Yong, X.; Golin, M., The number of spanning trees in circulant graphs, Discrete Math., 223, 337-350 (2000) · Zbl 0969.05036
[19] Zhang, Y.; Yong, X.; Golin, M., Chebyshev polynomials and spanning tree formulas for circulant and related graphs, Discrete Math., 298, 334-364 (2005) · Zbl 1070.05029
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.