Domination polynomial of clique cover product of graphs

Abstract: Let

G

be a simple graph of order

n

. The domination polynomial of

G

is the polynomial

D (G, x) = s u m_{i = 1}^{n} d (G, i) x^{i}

, where

d (G, i)

is the number of dominating sets of

G

of size

i

. For two graphs

G

and

H

, let

m a t h c a l C = C_{1}, C_{2}, c d o t s, C_{k}

be a clique cover of

G

and

U s u b s e t e q V (H)

. We consider clique cover product which denoted by

G^{m} a t h c a l C s t a r H^{U}

and obtained from

G

as follows: for each clique

C_{i} i n m a t h c a l C

, add a copy of the graph

H

and join every vertex of

C_{i}

to every vertex of

U

. We prove that the domination polynomial of clique cover product

G^{m} a t h c a l C s t a r H^{V (H)}

or simply

G^{m} a t h c a l C s t a r H

is [ D(G^mathcal{C} star H,x)=prod_{i=1}^kBig [�ig((1+x)^{n_i}-1�ig)(1+x)^{|V(H)|}+D(H,x)Big], ] where each clique

C_{i} i n m a t h c a l C

has

n_{i}

vertices. As results, we study the

m a t h c a l D

-equivalence classes of some families of graphs. Also we completely describe the

m a t h c a l D

-equivalence classes of friendship graphs constructed by coalescence

n

copies of the cycle graph of length three with a common vertex.

Recommendations

Cites work

Cited in

(2)

This page was built for publication: Domination polynomial of clique cover product of graphs