Counting spanning trees in cobordism of two circulant graphs

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

Original language	English
Pages (from-to)	1145-1157
Number of pages	13
Journal	Сибирские электронные математические известия
Volume	15
DOIs	https://doi.org/10.17377/semi.2018.15.093
Publication status	Published - 1 Jan 2018

Chebyshev polynomial, Circulant graph, I-graph, Mahler measure, Petersen graph, Spanning tree, I-GRAPHS, NUMBER, spanning tree, COMPLEXITY, circulant graph, FORMULAS

ID: 22323121