A Study on Dominator Coloring of Friendship and Barbell Graphs
Abstract views: 169 / PDF downloads: 104
Keywords:
Coloring, Domination, Dominator coloringAbstract
A dominator coloring of a graph $G$ is a proper coloring of $G$ in which every vertex should dominate every vertex of at least one color class. The dominator chromatic number $\chi_d(G)$ is the minimum number of color classes in a dominator coloring of $G$. In this paper we study the dominator chromatic number of the barbell graph $B_n$ and friendship graph $F_n$.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.