Global Journal of Engineering Science and Researches (GJESR)

Source ID:00000171
Volume 6, Issue 5,May 2019, Pages 525-529, Page Count - 5

STRONGLY CHROMATIC METRO DOMINATION OF Pn, Cn AND Pn 2

Vishukumar M (1) Vidyashree K (2) Lakshminarayana S (3)

(1) Department of Mathematics, REVA University, India.
(2) Department of Mathematics, School of Applied Science, REVA University, Bangalore, India.
(3) Department of Mathematics, School of Applied Science, REVA University, Bangalore, India.

Manuscript ID:- 00000-87225
Access Type : Open Access
Read Full Article


Cite this article:Vishukumar M,Vidyashree K,Lakshminarayana S,  Strongly Chromatic Metro Domination Of Pn, Cn And Pn 2, Global Journal of Engineering Science and Researches(GJESR), 2019, 6(5), PP.525-529

Manuscript Level Metrics (MLM)

Views Downloads Citations Cited References Social Shares
24 12 0 0

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.
AMS Mathematics Subject Classification (2010):05C56.
Author Keywords
Metric dimension Metro domination Strongly chromatic metro domination Power graph


ISSN Print: ISSN Online: 2348-8034
Source Type: Journals Document Type: Journal Article
Publication Language: English DOI: https://doi.org/10.5281/zenodo.3234986
Abbreviated Journal Title: GJESR Access Type: Open Access
Publisher Name: Somil Shah Resource Licence: CC BY-NC
Major Subject:Physical Sciences Subject Area classification: Mathematics
Subject area: Statistics and Probability Source: SCOPEDATABASE