• 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-NonCommercial-ShareAlike 4.0 International License.
© 2010-2022 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility
Web Counter
https://nrais.dgda.gov.bd/public/jepang/https://learning.modernland.co.id/api/toto/http://himatikauny.org/wp-includes/mahjong-ways-3/https://www.jst.hvu.edu.vn/akun-pro-kamboja/https://section.iaesonline.com/akun-pro-kamboja/https://journals.uol.edu.pk/sugar-rush/http://mysimpeg.gowakab.go.id/mysimpeg/aset/https://jurnal.jsa.ikippgriptk.ac.id/plugins/https://ppid.cimahikota.go.id/assets/demo/https://journals.zetech.ac.ke/scatter-hitam/https://silasa.sarolangunkab.go.id/swal/https://sipirus.sukabumikab.go.id/storage/uploads/-/sthai/https://sipirus.sukabumikab.go.id/storage/uploads/-/stoto/https://alwasilahlilhasanah.ac.id/starlight-princess-1000/https://www.remap.ugto.mx/pages/slot-luar-negeri-winrate-tertinggi/https://waper.serdangbedagaikab.go.id/storage/sgacor/https://waper.serdangbedagaikab.go.id/public/images/qrcode/slot-dana/https://siipbang.katingankab.go.id/storage_old/maxwin/https://waper.serdangbedagaikab.go.id/public/img/cover/10k/