CHROMATIC WEAK DOMATIC PARTITION IN GRAPHS

P. ARISTOTLE1, S. BALAMURUGAN2, P. SELVA LAKSHMI3, V. SWAMINATHAN4

[PDF]

Abstract

In a simple graph G, a subset D of V (G) is called a chromatic weak dom- inating set if D is a weak dominating set and (< D >) = (G). Similar to domatic partition, chromatic weak domatic partition can be dened. 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.

Keywords

Domatic number, Weak domatic number, Chromatic weak domatic number.