On Jacobian group and complexity of the generalized Petersen graph GP(n,k) through Chebyshev polynomials

Abstract

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.

References in corpus (1)

• Spanning trees on the Sierpinski gasket

Cited by in corpus (1)

• On Jacobian group and complexity of I-graph I(n,k,l) through Chebyshev polynomials