A dominating set D of a graph ðºðº=ðºðº(ð‘‰ð‘‰,ð¸ð¸) is called metro dominating set of G,if for every pair of vertices u, v there exists a vertex w in D such that ð‘‘ð‘‘(ð‘¢ð‘¢,ð‘¤ð‘¤)≠ð‘‘ð‘‘(ð‘£ð‘£,ð‘¤ð‘¤),the k -metro domination number of a square path ð›¾ð›¾ð›½ð›½ð‘˜ð‘˜(ð‘ƒð‘ƒð‘›ð‘›2), is the order of a smallest k-dominating set of ð‘ƒð‘ƒð‘›ð‘›2. which resolves as a metric set. In this paper, we calculate the k-metro domination number of square paths.
Volume 11 | Issue 2
Pages: 192-198