Author/Authors :
ARISTOTLE, P PG & Research Department of Mathematics - Raja Doraisingam Government Arts College - SivagangaiTamilnadu, India , BALAMURUGAN, S PG Department of Mathematics - Government Arts College - Tamilnadu, India , SELVA LAKSHMI, P Srinivasa Ramanujan Research Center in Mathematics - Sethupathy Government Arts College - Ramanathapuram - Tamilnadu, India , SWAMINATHAN, V Ramanujan Research Center in Mathematics - Saraswathi Narayanan College - Tamilnadu, India
Abstract :
In a simple graph G, a subset D of V (G) is called a chromatic weak dominating set if D is a weak dominating set and χ(< D >) = χ(G). Similar to domatic
partition, chromatic weak domatic partition can be defined. The maximum cardinality
of a chromatic weak domatic partition is called the chromatic weak domatic number of
G. Bounds for this number are obtained and new results are derived involving chromatic
weak domatic number and chromatic weak domination number.
