CHROMATIC WEAK DOMATIC PARTITION IN GRAPHS

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 [chi](< D >) = [chi](G). Similar to domatic partition, chromatic weak domatic partition can be defined. The maximum cardinality of a chromatic weak domatic partition is called t...

Full description

Saved in:
Bibliographic Details
Published inTWMS journal of applied and engineering mathematics Vol. 9; no. 2; p. 279
Main Authors Aristotle, P, Balamurugan, S, Lakshmi, P. Selva, Swaminathan, V
Format Journal Article
LanguageEnglish
Published Istanbul Turkic World Mathematical Society 01.07.2019
Elman Hasanoglu
Subjects
Graph theory
Mathematical research
Partitions (Mathematics)
Online AccessGet full text
ISSN2146-1147
2146-1147

Cover

More Information
Summary: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 [chi](< D >) = [chi](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. Keywords: Domatic number, Weak domatic number, Chromatic weak domatic number. AMS Subject Classification: 05C69
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2146-1147
2146-1147