M.  Vishukumar, S.  Lakshminarayana, 
    ON K-Metro Domination Number of <img src='http://www.medwelljournals.com/img1-2k19-2141-2145.gif' align='absmiddle' />,
    Journal of Engineering and Applied Sciences,
    Volume 14,Issue 7,
    2019,
    Pages 2141-2145,
    ISSN 1816-949x,
    jeasci.2019.2141.2145,
    (https://makhillpublications.co/view-article.php?doi=jeasci.2019.2141.2145)
    Abstract: 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" />).
    Keywords: Domination;metric dimension;metro domination;smallest;k-metro;resolves