Abstract
In the present paper we give a new method for calculating Jacobian group Jac(GP(n,k)) of the generalized Petersen graph GP(n,k). We show that the minimum number of generators of Jac(GP(n,k)) is at least two and at most 2k+1. Both estimates are sharp. Also, we obtain a closed formula for the number of spanning trees of GP(n,k) in terms of Chebyshev polynomials and investigate some arithmetical properties of this number.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
