The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic › Research Explorer

Novosibirsk State University's Research Portal

The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic

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

DOI

https://doi.org/10.1016/j.disc.2018.08.030
Final published version

Original language	English
Pages (from-to)	1772-1781
Number of pages	10
Journal	Discrete Mathematics
Volume	342
Issue number	6
DOIs	https://doi.org/10.1016/j.disc.2018.08.030
Publication status	Published - 1 Jun 2019

OECD FOS+WOS

Research areas

Chebyshev polynomial, Circulant graph, Laplacian matrix, Mahler measure, Spanning tree, JACOBIAN GROUP, COMPLEXITY

ID: 18861210