Konu "Paired-domination" için Işık Üniversitesi Yayınları listeleme
Toplam kayıt 3, listelenen: 1-3
-
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 ... -
Zero forcing and power domination for lexicographic product of two fuzzy soft graphs
(Işık University Press, 2020)Zero forcing and power domination are iterative processes on graphs where an initial set of vertices are observed, and additional vertices become observed based on some rules. In both cases, the goal is to eventually observe ...