Сибирский федеральный университет

Тип публикации: статья из журнала

Год издания: 2017

Идентификатор DOI: 10.1016/j.laa.2017.04.032

Ключевые слова: Chebyshev polynomial, Jacobian group, Laplacian matrix, Petersen graph, Spanning tree

Аннотация: 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. © 2017 Elsevier Inc.

Журнал: Linear Algebra and Its Applications

Выпуск журнала: Vol. 529

Номера страниц: 355-373

• Kwon Y.S. (Yeungnam Univ, Dept Math, Gyongsan, Gyeongsangbuk D, South Korea)
• Mednykh A.D. (Siberian Fed Univ, Sobolev Inst Math, Krasnoyarsk, Krasnoyarskiy K, Russia)
• Mednykh I.A. (Siberian Fed Univ, Sobolev Inst Math, Krasnoyarsk, Krasnoyarskiy K, Russia)

• Scopus
• Web of Science Core Collection
• Ядро РИНЦ (eLIBRARY.RU)