• ON THE K-METRO DOMINATION NUMBER OF CARTESIAN PRODUCT OF P2XPn

BASAVARAJU G C*, VISHUKUMAR M, RAGHUNATH P

Abstract


A dominating set  of a graph  is called metro dominating set  if for every pair of vertices  there exists a vertex   in  such that  The - metro domination number of Cartesian product of   is the order of smallest  - dominating set of  which resolves as a metric set. In this paper we calculate the - metro domination number of Cartesian product of .


Keywords


Metric Dimension, Landmark, k- dominating set, Metro 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/