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

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

Journal

Linear Algebra and Its Applications
ISSN: 0024-3795

Output data

Year: 2017, Volume: 529, Pages: 355-373 Pages count : 19 DOI: 10.1016/j.laa.2017.04.032

Tags

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

Authors

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

Affiliations

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

DB	Citing
Web of science	18
Scopus	19
OpenAlex	24