ON THE DOUBLE BONDAGE NUMBER OF GRAPHS PRODUCTS

A set D of vertices of graph G is called double dominating set if for any vertex v, jN[v] Dj 2. The minimum cardinality of double domination of G is denoted by d(G). The minimum number of edges E such that d(G n E) > d(G) is called the double bondage number of G and is denoted by bd(G). This paper determines that bd(G_H) and exact values of b(PnP2), and generalized corona product of graphs.