  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.
