In this paper we characterize the convex dominating sets in the composition and Cartesian product of two connected graphs. The concepts of clique dominating set and clique domination number of a… Expand

Let G be a simple connected graph. A connected dominating set S ⊆ V (G) is called a doubly connected dominating set of G if the subgraph 〈V (G)\S〉 induced by V (G)\S is connected. In this paper, we… Expand

In this paper, we describe the monophonic sets in the join and composition of two connected graphs and the composition G[K"n] of a connected graph.Expand

Let G =( V (G),E(G)) be a connected graph. A subset S of V (G) is a total dominating set of G if every vertex of G is adjacent to some vertex in S. The set NG(v) is the set of all vertices of G… Expand