One can hear a discrete rectangular torus
In the present paper, we prove that two discrete rectangular tori are isospectral if and only if they are isomorphic.
math.CO↗
arXiv subjects
I. A. Mednykh
Publications and source records attributed to I. A. Mednykh.
On Jacobian group and complexity of the Y-graph
In the present paper we suggest a simple approach for counting Jacobian group of the $Y$-graph $Y(n; k, l, m).$ In the case $Y(n; 1, 1, 1)$ the structure of the Jacobian group will be find explicitly. Also, we obtain a closed formula for the number of spanning trees of $Y$-graph in terms of Chebyshev polynomials and give its asymtotics.
math.CO↗
On complexity and Jacobian of cone over a graph
For any given graph $G$ consider a graph $\widetilde{G}$ which is a cone over graph $G.$ In this paper, we study two important invariants of such a cone. Namely, complexity (the number of spanning trees) and the Jacobian of a graph. We prove that complexity of graph $\widetilde{G}$ coincides the number of rooted spanning forests in graph $G$ and the Jacobian of $\widetilde{G}$ is isomorphic to cokernel of the operator $I+L(G),$ where $L(G)$ is Laplacian of $G$ and $I$ is the identity matrix. As a consequence, one can calculate the complexity of $\widetilde{G}$ as $\det(I+L(G)).$
math.CO↗
The number of rooted forests in circulant graphs
In this paper, we develop a new method to produce explicit formulas for the number $f_{G}(n)$ of rooted spanning forests in the circulant graphs $ G=C_{n}(s_1,s_2,\ldots,s_k)$ and $ G=C_{2n}(s_1,s_2,\ldots,s_k,n).$ These formulas are expressed through Chebyshev polynomials. We prove that in both cases the number of rooted spanning forests can be represented in the form $f_{G}(n)=p\,a(n)^2,$ where $a(n)$ is an integer sequence and $p$ is a prescribed natural number depending on the parity of $n$. Finally, we find an asymptotic formula for $f_{G}(n)$ through the Mahler measure of the associated Laurent polynomial $P(z)=2k+1-\sum\limits_{i=1}^k(z^{s_i}+z^{-s_i}).$
math.CO↗
On complexity of cyclic coverings of graphs
By complexity of a finite graph we mean the number of spanning trees in the graph. The aim of the present paper is to give a new approach for counting complexity $τ(n)$ of cyclic $n$-fold coverings of a graph. We give an explicit analytic formula for $τ(n)$ in terms of Chebyshev polynomials and find its asymptotic behavior as $n\to\infty$ through the Mahler measure of the associated voltage polynomial. We also prove that $F(x)=\sum\limits_{n=1}^\inftyτ(n)x^n$ is a rational function with integer coefficients.
math.CO↗
On rationality of generating function for the number of spanning trees in circulant graphs
Let $F(x)=\sum\limits_{n=1}^\inftyτ(n)x^n$ be the generating function for the number $τ(n)$ of spanning trees in the circulant graphs $C_{n}(s_1,s_2,\ldots,s_k).$ We show that $F(x)$ is a rational function with integer coefficients satisfying the property $F(x)=F(1/x).$ A similar result is also true for the circulant graphs of odd valency $C_{2n}(s_1,s_2,\ldots,s_k,n).$ We illustrate the obtained results by a series of examples.
math.CO↗
On Jacobian group and complexity of the generalized Petersen graph GP(n,k) through Chebyshev polynomials
In the present paper we find a simple algorithm for counting Jacobian group of the generalized Petersen graph GP(n,k). Also, we obtain a closed formula for the number of spanning trees of this graph in terms of Chebyshev polynomials.
math.CO↗