A Study on Dominator Coloring of Friendship and Barbell Graphs


Abstract views: 154 / PDF downloads: 98

Authors

  • A. Albina Department of Mathematics, Sree Narayana Guru College, Coimbatore, Tamil Nadu, India
  • U. Mary Department of Mathematics, Nirmala College for Women, Coimbatore, Tamil Nadu, India

Keywords:

Coloring, Domination, Dominator coloring

Abstract

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

15-12-2018

How to Cite

A. Albina, & U. Mary. (2018). A Study on Dominator Coloring of Friendship and Barbell Graphs. International Journal of Mathematics And Its Applications, 6(4), 99–105. Retrieved from http://ijmaa.in/index.php/ijmaa/article/view/332

Issue

Section

Research Article