Domination polynomials of even-order friendship graphs have three real roots with monotonic limits to -1 ± 1/√2 and magnitude bound |z| ≤ 1 + √(n/log 2); book graphs have complete root limit sets with parity-dependent real roots; both families lack nonzero integer roots.
Alikhani, The domination polynomial of a graph at−1,Graphs Combin.29(2013) 1175–1181
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On roots of domination polynomials for friendship and book graphs
Domination polynomials of even-order friendship graphs have three real roots with monotonic limits to -1 ± 1/√2 and magnitude bound |z| ≤ 1 + √(n/log 2); book graphs have complete root limit sets with parity-dependent real roots; both families lack nonzero integer roots.