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

(2) Sobolev Institute of Mathematics; 3; (3) Novosibirsk State University; 4); 4) ((1) Yengnam University; (4) Siberian Federal University; A. D. Mednykh (2; I. A. Mednykh (2; Krasnoyarsk; Novosibirsk

arxiv: 1612.03372 · v1 · pith:AGBGBSPInew · submitted 2016-12-11 · 🧮 math.CO

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

Y. S. Kwon (1) , A. D. Mednykh (2 , 3 , 4) , I. A. Mednykh (2 , 4) ((1) Yengnam University , Yengnam , South Korea

show 7 more authors

(2) Sobolev Institute of Mathematics Novosibirsk Russia (3) Novosibirsk State University (4) Siberian Federal University Krasnoyarsk Russia)

This is my paper

classification 🧮 math.CO

keywords graphchebyshevgeneralizedgroupjacobianpetersenpolynomialsalgorithm

0 comments

read the original 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.

This paper has not been read by Pith yet.

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

discussion (0)