Let 𝐺𝐺 be a graph. A dominating set 𝐷𝐷⊆ 𝑉𝑉 (𝐺𝐺) is called a secure dominating set of 𝐺𝐺
if for each vertex 𝑢𝑢∈ 𝑉𝑉 (𝐺𝐺)∖ 𝐷𝐷, there exists a vertex 𝑣𝑣∈ 𝐷𝐷 such that 𝑢𝑢𝑣𝑣∈ 𝐸𝐸 …

Let G be a connected simple graph. A set S⊆ VG is a restrained dominating set if every
vertex not in S is adjacent to a vertex in S and to a vertex in VG∖ S. A set S of vertices of a …

Let G be a connected simple graph. A set S of vertices of a graph G is an outer-convex
dominating set if every vertex not in S is adjacent to some vertex in S and V (G)∖ S is a …

The perfect dominating set 𝑆 is called a perfect doubly connected dominating set if it is
doubly connected set in 𝐺. The minimum cardinality of a perfect doubly connected …

In this paper, we initiate the study of super fair dominating set of a graph 𝐺 by giving the
super fair domination number of some special graphs. Further, we shows that given positive …

Let be a connected simple graph. A convex dominating set of is a convex secure dominating
set, if for each element thereexists an element such that and is adominating set. The convex …

Let G be a connected simple graph. A set S⊆ V (G) is a doubly connected dominating set if it
is dominating and both〈 S〉 and〈 V (G)∖ S〉 are connected. A nonempty subset S of the …

Fair Restrained Dominating Set in the Corona of Graphs Page 1 International Journal of
Engineering and Management Research e-ISSN: 2250-0758 | p-ISSN: 2394-6962 Volume-10 …

Fair Secure Dominating Set in the Corona of Graphs Page 1 International Journal of
Engineering and Management Research e-ISSN: 2250-0758 | p-ISSN: 2394-6962 Volume-10 …

Let 𝐺 be a connected simple graph. A nonempty subset 𝑆 of the vertex set 𝑉 (𝐺) is a clique
in 𝐺 if the graph〈 𝑆〉 induced by 𝑆 is complete. A clique 𝑆 in 𝐺 is a clique dominating set if …