Dergiler / TWMS Journal of Applied and Engineering Mathematics / 2019 / Cilt: 9 - Sayı: 2

CHROMATIC WEAK DOMATIC PARTITION IN GRAPHS

P. ARİSTOTLE, S. BALAMURUGAN, P. P. LAKSHMİ, V. SWAMİNATHAN

Sayfa
279–286
DOI
—

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 = G . Similar to domatic partition, chromatic weak domatic partition can be dened. 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.