CONVEX SECURE DOMINATIONIN THE JOIN AND CARTESIAN PRODUCT OF GRAPHS

Abstract

Let be a connected simple graph. A convex dominating set of is a convex secure dominating set, if for each element there exists an element such that and is a dominating set. The convex secure domination number denoted by is the minimum cardinality of a convex secure dominating set of cardinality will be called a - In this paper, we investigate the concept and give some important results on convex secure dominating sets in the join and Cartesian product of two graphs.

 

Mathematics Subject Classification: 05C69

 

Keywords: dominating set, convex dominating set, convex secure dominating set