On the dominated chromatic number of certain graphs
عنوان مقاله: On the dominated chromatic number of certain graphs
شناسه ملی مقاله: JR_COMB-9-4_004
منتشر شده در در سال 1399
شناسه ملی مقاله: JR_COMB-9-4_004
منتشر شده در در سال 1399
مشخصات نویسندگان مقاله:
Saeid Alikhani - Department of Mathematics, Yazd University, ۸۹۱۹۵-۷۴۱, Yazd, Iran
Mohammad Reza Piri - Department of Mathematics, Yazd University, ۸۹۱۹۵-۷۴۱, Yazd, Iran
خلاصه مقاله:
Saeid Alikhani - Department of Mathematics, Yazd University, ۸۹۱۹۵-۷۴۱, Yazd, Iran
Mohammad Reza Piri - Department of Mathematics, Yazd University, ۸۹۱۹۵-۷۴۱, Yazd, Iran
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.
کلمات کلیدی: dominated chromatic number, Stability, bondage number
صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/1194844/