TY - JOUR
ID - 24862
TI - On the dominated chromatic number of certain graphs
JO - Transactions on Combinatorics
JA - TOC
LA - en
SN - 2251-8657
AU - Alikhani, Saeid
AU - Piri, Mohammad Reza
AD - Department of Mathematics, Yazd University, 89195-741, Yazd, Iran
Y1 - 2020
PY - 2020
VL - 9
IS - 4
SP - 217
EP - 230
KW - dominated chromatic number
KW - Stability
KW - bondage number
DO - 10.22108/toc.2020.119361.1675
N2 - 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.
UR - https://toc.ui.ac.ir/article_24862.html
L1 - https://toc.ui.ac.ir/article_24862_7ee6f29ca5ca8795e3a390c8fe8145c4.pdf
ER -