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. 
Y. S. Kwon (1), A. D. Mednykh (2,3,4), I. A. Mednykh (2,3,4) ((1)   Yengnam University, Yengnam, South Korea, (2) Sobolev In...
math.CO