Title

Dominator Colorings of Certain Cartesian Products of Paths and Cycles.

Authors

Chen, Qin; Zhao, Chengye; Zhao, Min

Abstract

A dominator coloring of a graph G is a proper coloring of G with the additional property that every vertex dominates an entire color class. The dominator chromatic number $$\chi _d(G)$$ of G is the minimum number of colors among all dominator colorings of G. In this paper, we determine the dominator chromatic numbers of Cartesian product graphs $$P_2 \square P_n$$ and $$P_2 \square C_n$$ .

Subjects

GRAPH coloring; GEOMETRIC vertices; NUMBER systems; MATHEMATICAL analysis; MATHEMATICS research

Publication

Graphs & Combinatorics, 2017, Vol 33, Issue 1, p73

ISSN

0911-0119

Publication type

Academic Journal

DOI

10.1007/s00373-016-1742-7