arXiv Analytics

Sign in

arXiv:1305.3734 [math.CO]AbstractReferencesReviewsResources

Final title: "More on domination polynomial and domination root" Previous title: "Graphs with domination roots in the right half-plane"

Saeid Alikhani, Emeric Deutsch

Published 2013-05-16, updated 2014-02-28Version 2

Let $G$ be a simple graph of order n. The domination polynomial of G is the polynomial D(G,x) =\sum d(G, i)x^i, where d(G,i) is the number of dominating sets of G of size i. Every root of D(G,x) is called the domination root of G. It is clear that (0,\infty) is zero free interval for domination polynomial of a graph. It is interesting to investigate graphs which have complex domination roots with positive real parts. In this paper, we first investigate complexity of the domination polynomial at specific points. Then we present and investigate some families of graphs whose complex domination roots have positive real part.

Comments: 18 Pages, 6 Figures. To appear in Ars Combin
Categories: math.CO
Subjects: 05C60
Related articles: Most relevant | Search more
arXiv:1210.3144 [math.CO] (Published 2012-10-11)
Some new results on domination roots of a graph
arXiv:1403.1999 [math.CO] (Published 2014-03-08, updated 2014-04-02)
On the domination polynomials of cactus chains
arXiv:1511.08086 [math.CO] (Published 2015-11-25)
Domination polynomial of lexicographic product of specific graphs