13 research outputs found
On the roots of total domination polynomial of graphs, II
Let be a simple graph of order . The total dominating set of
is a subset of that every vertex of is adjacent to some
vertices of . The total domination number of is equal to minimum
cardinality of total dominating set in and is denoted by . The
total domination polynomial of is the polynomial
, where is the number
of total dominating sets of of size . A root of is called a
total domination root of . The set of total domination roots of graph is
denoted by . In this paper we show that has
non-real roots and if all roots of are real then ,
where is the minimum degree of vertices of . Also we show that if
and has exactly three distinct roots, then
.
Finally we study the location roots of total domination polynomial of some
families of graphs.Comment: 10 pages, 5 figure
Dominating Sets and Domination Polynomials of Graphs
This thesis introduces domination polynomial of a graph. The domination polynomial of a graph G of order n is the polynomial D(G; x) =
Pn
i=°(G) d(G; i)xi,
where d(G; i) is the number of dominating sets of G of size i, and °(G) is the
domination number of G. We obtain some properties of this polynomial, and
establish some relationships between the domination polynomial of a graph G
and geometrical properties of G.
Since the problem of determining the dominating sets and the number of
dominating sets of an arbitrary graph has been shown to be NP-complete,
we study the domination polynomials of classes of graphs with specific construction. We introduce graphs with specific structure and study the construction of the family of all their dominating sets. As a main consequence,
the relationship between the domination polynomials of graphs containing a
simple path of length at least three, and the domination polynomial of related graphs obtained by replacing the path by a shorter path is, D(G; x) = x
h
D(G¤e1; x)+D(G¤e1 ¤e2; x)+D(G¤e1 ¤e2 ¤e3; x)
i, where G¤e is the graph
obtained from G by contracting the edge e, and e1; e2 and e3 are three edges of
the path. As an example of graphs which contain no simple path of length at
least three, we study the family of dominating sets and the domination polynomials of centipedes. We extend the result of the domination polynomial of
centipedes to the graphs G ± K1, where G ± K1 is the corona of the graph G
and the complete graph K1.
As is the case with other graph polynomials, such as the chromatic polynomials
and the independence polynomials, it is natural to investigate the roots of
domination polynomial. In this thesis we study the roots of the domination
polynomial of certain graphs and we characterize graphs with one, two and
three distinct domination roots.
Two non-isomorphic graphs may have the same domination polynomial. We say
that two graphs G and H are dominating equivalence (or simply D-equivalence)
if D(G; x) = D(H; x). We study the D-equivalence classes of some graphs. We
end the thesis by proposing some conjectures and some questions related to
this polynomial