Some families of graphs with no nonzero real domination roots

Somayeh Jahari, Saeid Alikhani

Abstract


Let G be a simple graph of order n. The domination polynomial of G is the polynomial $D(G, x)=\sum_{i=\gamma(G)}^{n} d(G,i) x^{i}$, where d(G,i) is the number of dominating sets of G of size i and $\gamma(G)$ is the domination number of G. A root of D(G, x) is called a domination root of G. Obviously, 0 is a domination root of every graph G with multiplicity $\gamma(G)$. In the study of the domination roots of graphs, this naturally raises the question: Which graphs have no nonzero real domination roots? In this paper we present some families of graphs whose have this property.


Keywords


domination polynomial, domination root, friendship, complex root.

Full Text:

PDF

DOI: http://dx.doi.org/10.5614/ejgta.2018.6.1.2

Refbacks

  • There are currently no refbacks.


ISSN: 2338-2287

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

View EJGTA Stats