• SUPER SECURE DOMINATION IN GRAPHS

Abstract

Let  be a simple graph. A set  is called a secure dominating set of a graph  if for every vertex , there exists  such that  is dominating. It is a super secure dominating set if  The minimum cardinality of a super secure dominating set in , denoted by , is called the super secure domination number of . In this paper, we initiate the study of the concept and give some important results.