Konu "Critical graph" için JAEM 2019, Vol 9, No 2 listeleme
Toplam kayıt 2, listelenen: 1-2
-
Chromatic weak domatic partition in graphs
(Işık University Press, 2019)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 ... -
Tight just excellent graphs
(Işık University Press, 2019)A graph G is ?-excellent if for every vertex v, there exists a chromatic partition ? such that {v} ? ?.A graph G is just ?-excellent if every vertex appears as a singleton in exactly one ?-partition. In this paper, a special ...