On roots of domination polynomials for friendship and book graphs

This study examines the domination polynomials of friendship graphs and book graphs, focusing on unanswered questions related to these families [Alikhani, Brown and Jahari, on the domination polynomials of friendship graphs, Filomat $\mathbf{\text{30}}$(1) (2016) 169–178]. For the friendship graph $F_n$, with even $n$, we show that the polynomial $D(F_n,x)$ has exactly three real zeros: $0$ and two simple zeros in the intervals $(-2,-1)$ and $(-1,0)$. We further show that these two nonzero zeros have monotonic variation and converge to $-1-\frac{1}{\sqrt{2}}$ and $-1+\frac{1}{\sqrt{2}}$, respectively. We obtain the quantitative approximation $(\mathrm{\mid }z\mathrm{\mid }-1{)}^2\log \mathrm{\mid }z\mathrm{\mid }\le n$ for any complex zeros of $D(F_n,x)$, resulting in the explicit bound $\mathrm{\mid }z\mathrm{\mid }\le 1+\sqrt{\frac{n}{\log 2}}$. For book graphs $B_n$, we ascertain the comprehensive limit set of domination roots and establish results about the presence of real roots contingent on parity. We provide a partial answer to the integer-root an issue by establishing that friendship and book graphs have no nonzero integer domination roots, whereas for corona families, the only nonzero integer root is $-2$.