• SUPER SECURE DOMINATION IN GRAPHS

MICHAEL P. BALDADO, Jr., ENRICO L. ENRIQUEZ*

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.


Keywords


domination, secure domination, super domination, super secure domination.

Full Text:

PDF


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 Unported License.
© 2010-2016 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility
Web Counter