%0 Journal Article
%T On the dominated chromatic number of certain graphs
%J Transactions on Combinatorics
%I University of Isfahan
%Z 2251-8657
%A Alikhani, Saeid
%A Piri, Mohammad Reza
%D 2020
%\ 12/01/2020
%V 9
%N 4
%P 217-230
%! On the dominated chromatic number of certain graphs
%K dominated chromatic number
%K Stability
%K bondage number
%R 10.22108/toc.2020.119361.1675
%X Let $G$ be a simple graph. The dominated coloring of $G$ is a proper coloring of $G$ such that each color class is dominated by at least one vertex. The minimum number of colors needed for a dominated coloring of $G$ is called the dominated chromatic number of $G$, denoted by $\chi_{dom}(G)$. Stability (bondage number) of dominated chromatic number of $G$ is the minimum number of vertices (edges) of $G$ whose removal changes the dominated chromatic number of $G$. In this paper, we study the dominated chromatic number, dominated stability and dominated bondage number of certain graphs.
%U https://toc.ui.ac.ir/article_24862_7ee6f29ca5ca8795e3a390c8fe8145c4.pdf