Abstract Let G=(V, E) be a graph. A dominating set S of graph G is defined as a set of
vertices such that every vertex in V\S is adjacent to at least one vertex in S. The domination …

A dominating set S of a graph G (V, E) is called a secure dominating set, if for each vertex x
belongs to V (G)\S there exists at least one vertex y in S such that y belongs to the …

A nonempty set S⊆ V (G) of a graph G=(V, E) is an open packing set of G if no two vertices
of S have a common neighbor in G. The maximum cardinality of an open packing set is …