On Jacobian group and complexity of the Y-graph

2021/11/08 by Young Soo Kwon, Alexander Mednykh, Kwon, Y. S. +3
Computer Science · Mathematics · #05C30 #39A06 #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Topological and Geometric Data Analysis

paper · pdf · doi:10.48550/arxiv.2111.04304

openalex publication_date 2021/11/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• On Jacobian group and complexity of I-graph I(n,k,l) through Chebyshev polynomials
• On Jacobian group and complexity of the generalized Petersen graph GP(n,k) through Chebyshev polynomials
• On Jacobian group of the Δ-graph
• On the complexity of Cayley graphs on a dihedral group
• The Jacobian of a graph and graph automorphisms