Domination polynomial of lexicographic product of specific graphs

2015/11/25 by Saeid Alikhani, Alikhani, Saeid, Somayeh Jahari +1
Mathematics · #05C60 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05C60

paper · pdf · doi:10.48550/arxiv.1511.08086

7 pages, 2 figures

arxiv created 2015/11/25 · arxiv updated 2015/11/26

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. We consider the lexicographic product of two specific graphs and study their domination polynomials.

Related

• Some new results on domination roots of a graph
• Introduction to Domination Polynomial of a Graph
• Cycles are determined by their domination polynomials
• On the super domination number of lexicographic product graphs
• An atlas of domination polynomials of graphs of order at most six