On Jacobian group and complexity of the I-graph I(n, k, l) through Chebyshev polynomials › Research Explorer

Novosibirsk State University's Research Portal

On Jacobian group and complexity of the I-graph I(n, k, l) through Chebyshev polynomials

Research output: Contribution to journal › Article › peer-review

Theory of Functions Section

DOI

https://doi.org/10.26493/1855-3974.1355.576
Final published version

Ilya A. Mednykh

Original language	English
Pages (from-to)	467-485
Number of pages	19
Journal	Ars Mathematica Contemporanea
Volume	15
Issue number	2
DOIs	https://doi.org/10.26493/1855-3974.1355.576
Publication status	Published - 2018

Research areas

Chebyshev polynomial, I-graph, Jacobian group, Petersen graph, Spanning tree

OECD FOS+WOS

ID: 28012547