Explicit formulas via Chebyshev polynomials for rooted spanning forests in circulant graphs C_n(s1..sk) and C_2n, with f_G(n)=p a(n)^2 and asymptotic via Mahler measure of associated Laurent polynomial.
Sedl´ acˇ ek, On the spanning trees of finite graphs, ˇCas
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The number of rooted forests in circulant graphs
Explicit formulas via Chebyshev polynomials for rooted spanning forests in circulant graphs C_n(s1..sk) and C_2n, with f_G(n)=p a(n)^2 and asymptotic via Mahler measure of associated Laurent polynomial.