Journal of Engineering and Applied Sciences
ISSN: Online 1818-7803ISSN: Print 1816-949x
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)…d(v, w). The k-metro domination number of square
of a cycle, λβk (
) is the order of a smallest k-dominating set of () which resolves as a metric set. In this k
study, we caculate the k-metro domination number of ().
How to cite this article:
S. Lakshminarayana and M. Vishukumar. ON K-Metro Domination Number of 
.
DOI: https://doi.org/10.36478/jeasci.2019.2141.2145
URL: https://www.makhillpublications.co/view-article/1816-949x/jeasci.2019.2141.2145