On Jacobian group and complexity of the Y-graph

Abstract

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.

arXiv admin note: text overlap with arXiv:1703.07058, arXiv:1612.03372

References in corpus (1)

• Spanning trees on the Sierpinski gasket