Distance Domination in Vertex Partitioned Graphs

Abstract

We treat a variation of graph domination which involves a partition (V 1, V 2,..., Vk ) of the vertex set of a graph G and domination of each partition class V i over distance d where all vertices and edges of G may be used in the domination process. Strict upper bounds and extremal graphs are presented; the results are collected in three handy tables. Further, we compare a high number of partition classes and the number of dominators needed.