Domination Polynomial- the Study of Various Graph Operations

Abstract

Let G - VE be a graph of order n. The independent domination polynomial of G is the polynomial It D; G, X = L di G, j x!, J,,.r, where is the quantity of free overwhelming arrangements of size . In this paper, we present the free mastery polynomial of a chart. The autonomous mastery polynomials of some standard diagrams are acquired and a few properties of the free control polynomial of charts are set up Let G be a simple graph of order n. Toe domination polynomial of C ts the polynomial D(G, ,l.} = !.:.....o d(G, i)t, where d(CU) is tb.e number of dominating sets of G of sli.e i. Every root of D(C, l) ls caused the denomination root of G. In this paper, we study the domination polynomial of some graph operations