• WEAKLY CONVEX DOUBLY CONNECTED DOMINATION IN GRAPHS UNDER SOME BINARY OPERATIONS

RUJUBE N. HINOGUIN, ENRICO L. ENRIQUEZ*

Abstract


Let  be a connected simple graph. A weakly convex dominating set  of  is a weakly convex doubly connected dominating set if  is a doubly connected dominating set of . The weakly convex doubly connected domination number of , denoted by is the smallest cardinality of a convex doubly connected dominating set  of . In this paper, we characterized the weakly convex doubly connected dominating sets of the composition and Cartesian product of graphs.


Keywords


dominating set, doubly connected dominating set, convex dominating set, convex doubly connected dominating set

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://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/https://waper.serdangbedagaikab.go.id/storage/app/https://waper.serdangbedagaikab.go.id/storage/idn/