Equality of Strong Domination and Chromatic Strong Domination in Graphs

S Balamurugan, A Wilson Baskar, V Swaminathan


A subset $D$ of a vertex set $V$ of a graph $G$ is a chromatic strong dominating set if $D$ is a strong dominating set and $\chi()=\chi(G)$.

The minimum cardinality of chromatic strong dominating set is called chromatic strong domination number of $G$ and is denoted by $\gamma_{s}^c(G)$. In this paper we study relationship between strong domination and chromatic strong domination of a graph.

Full Text:



  • There are currently no refbacks.

Web Counters

IJMSC has been indexed in several world class data bases like Google Scholar, DRJI (Directory of Research Journals Indexing) ,Cite Factor, Research Bible.

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.