Search
Frontpage
Staff
Prizes
Equipment
Projects
Activities
Research units
Research output
Press/Media
About
On Jacobian group and complexity of the generalized Petersen graph GP(n,k) through Chebyshev polynomials
Research output
:
Contribution to journal
›
Article
›
peer-review
Applied Probability Laboratory
Theory of Functions Section
Overview
Cite this
DOI
https://doi.org/10.1016/j.laa.2017.04.032
Final published version
Y. S. Kwon
A. D. Mednykh
I. A. Mednykh
Original language
English
Pages (from-to)
355-373
Number of pages
19
Journal
Linear Algebra and Its Applications
Volume
529
DOIs
https://doi.org/10.1016/j.laa.2017.04.032
Publication status
Published -
15 Sept 2017
Research areas
Chebyshev polynomial, Jacobian group, Laplacian matrix, Petersen graph, Spanning tree, SANDPILE GROUP, NUMBER, SPANNING TREE FORMULAS, CIRCULANT
OECD FOS+WOS
ID: 9032346