Chromatic weak domatic partition in graphs
Göster/ Aç
Tarih
2019Yazar
Aristotle, PanneerselvamBalamurugan, Solayappan
Selva Lakshmi, P.
Swaminathan, Venkatasubramanian
Üst veri
Tüm öğe kaydını gösterKünye
Aristotle, P., Balamurugan, S., Selva Lakshmi, P. & Swaminathan, V. (2019). Chromatic weak domatic partition in graphs. TWMS Journal of Applied and Engineering Mathematics, 9(2), 279-286.Özet
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.
Kaynak
TWMS Journal of Applied and Engineering MathematicsCilt
9Sayı
2Bağlantı
http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/2716http://jaem.isikun.edu.tr/web/index.php/archive/101-vol9no2/407
Koleksiyonlar
Aşağıdaki lisans dosyası bu öğe ile ilişkilidir: