• INDEPENDENT VERTEX-EDGE DOMINATION IN GRAPHS

SHIGEHALLI V.S., VIJAYAKUMAR PATIL*

Abstract


Let the vertices and edges of a graph  be called the elements of . A set  of elements in  is an vertex-edge dominating set of  if every element not in  is either adjacent or incident to at least one element in . An vertex-edge dominating set  of elements in  is an independent vertex-edge dominating set of  if any two elements in  are neither adjacent nor incident. The independent vertex-edge domination number  of , is the smallest cardinality of an independent vertex-edge dominating set of . In this paper,  we  obtained bounds for .


Keywords


domination, vertex-edge domination, independent vertex-edge domination number.

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://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/