Effects of Some Operations on Domination Chromatic Number in Graphs

arXiv1909.05510MaRDI QIDQ6325157FDOQ6325157

Dongyang Zhao, Yangyang Zhou

Publication date: 12 September 2019

Abstract: For a simple graph $G$, a domination coloring of $G$ is a proper vertex coloring such that every vertex of $G$ dominates at least one color class, and every color class is dominated by at least one vertex. The domination chromatic number, denoted by $ch{i}_{dd}(G)$, is minimum number of colors among all domination colorings of $G$. In this paper, we discuss the effects of some typical operations on $ch{i}_{dd}(G)$, such as vertex (edge) removal, vertex (edge) contraction, edge subdivision, and cycle extending.

This page was built for publication: Effects of Some Operations on Domination Chromatic Number in Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6325157)