Metro domination number of powers of cycle
G. C. Basavaraju, M. Vishukumar, P. Raghunath · AIP conference proceedings · 2019
A dominating set D of a graph G = G(V, E) G = G(V, E) is called metro dominating set of D. If for every pair vertices u, v there is a vertex w in D, such that d(u, w) ≠ d(v, w). The metro domination number of a cycle γβ(Cnk), is the order of a minimum dominating set of Cn, Which resolves as a metric set. In this paper we determine metro domination number of powers of cycle.