pith. sign in

arxiv: 1305.3734 · v2 · pith:5GCM7IE4new · submitted 2013-05-16 · 🧮 math.CO

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

classification 🧮 math.CO
keywords dominationpolynomialgraphsinvestigaterootrootscomplexgraph
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.