• ON THE K-METRO DOMINATION NUMBER OF CARTESIAN PRODUCT OF P2XPn
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:
PDFThis 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 |