Dominated chromatic number of central graphs
Let [Formula: see text] be a graph with no isolated vertex. A dominated coloring of [Formula: see text] is a proper coloring of [Formula: see text] such that each color class is dominated by at least one vertex. The minimum number of colors needed for a dominated coloring of [Formula: see text] is called the dominated...