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.
We consider the number of spanning trees in circulant graphs of βn vertices with generators depending linearly on n. The matrix tree theorem gives a closed formula of βn factors, while we derive a formula of β − 1 factors. Using the same trick, we also derive a formula for the number of spanning trees in discrete tori. Moreover, the spanning tree entropy of circulant graphs with fixed and non-fixed generators is compared.
In this paper, we compute asymptotics for the determinant of the combinatorial Laplacian on a sequence of d-dimensional orthotope square lattices as the number of vertices in each dimension grows at the same rate. It is related to the number of spanning trees by the wellknown matrix tree theorem. Asymptotics for 2 and 3 component rooted spanning forests in these graphs are also derived. Moreover, we express the number of spanning trees in a 2-dimensional square lattice in terms of the one in a 2-dimensional discrete torus and also in the quartered Aztec diamond. As a consequence, we find an asymptotic expansion of the number of spanning trees in a subgraph of Z 2 with a triangular boundary.
The number of spanning trees in a class of directed circulant graphs with generators depending linearly on the number of vertices βn, and in the n-th and (n − 1)-th power graphs of the βn-cycle are evaluated as a product of β/2 − 1 terms.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.