STRONGLY CHROMATIC METRO DOMINATION OF 𝑷 𝒏, 𝑪𝒏 AND 𝑷𝒏𝟐
Authors: María del Pilar Gómez, Diego A. Muñoz
DOI: 10.87349/JBUPT/27408
Page No: 47-50
Abstract
A dominating set D of a graph G(V,E) is called metro dominating set G if for every pair of vertices u,v, there exists a vertex w in D such that d(u,w) ≠ d(v,w). A metro dominating set D is called strongly chromatic metro dominating set if for every vertex v∈ D is from the same color class. The minimum cardinality strongly chromatic metro dominating set is called strongly chromatic metro domination number and is denoted by SC𝛾𝛽. In this paper we find strongly chromatic metro domination number of path, cycles and square of a path.
