Some new results on domination roots of a graph

2012/10/11 by Alikhani, Saeid
#05C60 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1210.3144

Abstract

Let G be a simple graph of order n. The domination polynomial of G is the polynomial D(G,λ)=∑_i=0ⁿ d(G,i) λⁱ, where d(G,i) is the number of dominating sets of G of size i. Every root of D(G,λ) is called the domination root of G. We present families of graphs whose their domination polynomial have no nonzero real roots. We observe that these graphs have complex domination roots with positive real part. Then, we consider the lexicographic product of two graphs and obtain a formula for domination polynomial of this product. Using this product, we construct a family of graphs which their domination roots are dense in all of ℂ.

Related

• Some families of graphs with no nonzero real domination roots
• Final title: "More on domination polynomial and domination root" Previous title: "Graphs with domination roots in the right half-plane"
• Domination polynomials of k-tree related graphs
• Domination polynomial of lexicographic product of specific graphs
• An atlas of domination polynomials of graphs of order at most six