On Stratified Domination in Prisms
Süleyman Ediz · Van Yüzüncü Yıl University Academic Data Management System · 2009
A graph G is 2-stratified if its vertex set is partitioned into two nonempty classes (each of which is a stratum or a color class).We color the vertices in one color class red and the other class blue. Let S be 2-stratified graph with one fixed blue vertex v specified. We say that S is rooted at v. The S-domination number of a graph G is the minimum number of red vertices of G in a red-blue coloring of the vertices of G such that for every blue vertex v of G, there is a copy of S in G rooted