On Jacobian group and complexity of the generalized Petersen graph GP(n,k) through Chebyshev polynomials
Combinatorics
2016-12-13 v1
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.
Keywords
Cite
@article{arxiv.1612.03372,
title = {On Jacobian group and complexity of the generalized Petersen graph GP(n,k) through Chebyshev polynomials},
author = {Y. S. Kwon and A. D. Mednykh and I. A. Mednykh},
journal= {arXiv preprint arXiv:1612.03372},
year = {2016}
}