On Jacobian group and complexity of the generalized Petersen graph GP(n,k) through Chebyshev polynomials | Sciact - Система учета научной деятельности ИМ СО РАН

On Jacobian group and complexity of the generalized Petersen graph GP(n,k) through Chebyshev polynomials Научная публикация

Журнал

Linear Algebra and Its Applications
ISSN: 0024-3795

Вых. Данные

Год: 2017, Том: 529, Страницы: 355-373 Страниц : 19 DOI: 10.1016/j.laa.2017.04.032

Ключевые слова

Chebyshev polynomial; Jacobian group; Laplacian matrix; Petersen graph; Spanning tree

Авторы

Kwon Y.S. ⁴ , Mednykh A.D. ^1,2,3 , Mednykh I.A. ^1,2,3

Организации

1	Sobolev Institute of Mathematics
2	Novosibirsk State University
3	Siberian Federal University
4	Yeungnam University

Kwon Y.S. , Mednykh A.D. , Mednykh I.A.
On Jacobian group and complexity of the generalized Petersen graph GP(n,k) through Chebyshev polynomials
Linear Algebra and Its Applications. 2017. V.529. P.355-373. DOI: 10.1016/j.laa.2017.04.032 WOS Scopus OpenAlex

Web of science:	WOS:000404501600018
Scopus:	2-s2.0-85019123036
OpenAlex:	W2563773140

БД	Цитирований
Web of science	17
Scopus	18
OpenAlex	23