arXiv Analytics

Sign in

arXiv:1612.03372 [math.CO]AbstractReferencesReviewsResources

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

Y. S. Kwon, A. D. Mednykh, I. A. Mednykh

Published 2016-12-11Version 1

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.

Categories: math.CO
Subjects: 05C30, 39A10
Related articles: Most relevant | Search more
arXiv:1703.07058 [math.CO] (Published 2017-03-21)
On Jacobian group and complexity of I-graph I(n,k,l) through Chebyshev polynomials
arXiv:1902.05681 [math.CO] (Published 2019-02-15)
Complexity of the circulant foliation over a graph
arXiv:2312.16447 [math.CO] (Published 2023-12-27)
On the complexity of Cayley graphs on a dihedral group

Links

Toolbox