@article{MAKHILLJEAS201914717650,
    title = {ON K-Metro Domination Number of <img src='http://www.medwelljournals.com/img1-2k19-2141-2145.gif' align='absmiddle' />},
    journal = {Journal of Engineering and Applied Sciences},
    volume = {14},
    number = {7},
    pages = {2141-2145},
    year = {2019},
    issn = {1816-949x},
    doi = {jeasci.2019.2141.2145},
    url = {https://makhillpublications.co/view-article.php?issn=1816-949x&doi=jeasci.2019.2141.2145},
    author = {M. and},
    keywords = {Domination,metric dimension,metro domination,smallest,k-metro,resolves},
    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" />).}
    }