• INVERSE LINE DOMINATION IN GRAPHS

M. H. Muddebihal*, U. A. Panfarosh, Anil R. Sedamkar, India.

Abstract


Let  be the line graph of  and let  be a line dominating set in , if  contains another dominating  set , then  is called an inverse line dominating set with respect to . The minimum cardinality of vertices in such a set is called an inverse line domination number in  and is denoted by. In this paper, we study the graph theoretic properties of  and many bounds were obtained in terms of elements of  and its relationships with other domination parameters were found.


Keywords


Graph, Line graph, Dominating set, Inverse dominating set, Inverse 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://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/