Asymptotics and Arithmetical Properties of Complexity for Circulant Graphs › Research Explorer

Novosibirsk State University's Research Portal

Asymptotics and Arithmetical Properties of Complexity for Circulant Graphs

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

DOI

https://doi.org/10.1134/S1064562418020138
Final published version

Original language	English
Pages (from-to)	147-151
Number of pages	5
Journal	Doklady Mathematics
Volume	97
Issue number	2
DOIs	https://doi.org/10.1134/S1064562418020138
Publication status	Published - 1 Mar 2018

Research areas

SPANNING TREE FORMULAS, CHEBYSHEV POLYNOMIALS, NUMBER

OECD FOS+WOS

ID: 13487835