TY  - JOUR
T1  - ON K-Metro Domination Number of <img src='http://www.medwelljournals.com/img1-2k19-2141-2145.gif' align='absmiddle' />
AU - Vishukumar, M. AU - Lakshminarayana, S. 
JO  - Journal of Engineering and Applied Sciences
VL  - 14
IS  - 7
SP  - 2141
EP  - 2145
PY  - 2019
DA  - 2001/08/19
SN  - 1816-949x
DO  - jeasci.2019.2141.2145
UR  - https://makhillpublications.co/view-article.php?doi=jeasci.2019.2141.2145
KW  - Domination
KW  -metric dimension
KW  -metro domination
KW  -smallest
KW  -k-metro
KW  -resolves
AB  - A dominating set D of a graph G = G(V, E) is called metro dominating set of G if for every pair of
vertices u, v there exists a vertex w in D such that d(u, w)&#133;d(v, w). The k-metro domination number of square
of a cycle, &lambda;&beta;<sub>k</sub> (<img src="https://www.medwelljournals.com/img1-2k19-2141-2145.gif" width="15" height="16" align="absmiddle" />) is the order of a smallest k-dominating set of (<img src="https://www.medwelljournals.com/img1-2k19-2141-2145.gif" width="15" height="16" align="absmiddle" />) which resolves as a metric set. In this k
study, we caculate the k-metro domination number of (<img src="https://www.medwelljournals.com/img1-2k19-2141-2145.gif" width="15" height="16" align="absmiddle" />).
ER  -