Dominator Chromatic Number, Bondage Number and Domatic Number of Some Named Graphs


Abstract views: 8 / PDF downloads: 18

Authors

  • J. Arockia Aruldoss Department of Mathematics, St. Joseph’s College of Arts & Science, Manjakuppam, Cuddalore (Tamil Nadu), India
  • G. Gurulakshmi Department of Mathematics, St. Joseph’s College of Arts & Science, Manjakuppam, Cuddalore (Tamil Nadu), India

Keywords:

Proper coloring, Dominator coloring, Dominator Chromatic number, Bondage number, Domatic number, Fruncht graph, Herschel graph, Wagner graph, Moser Spindle graph

Abstract

Let $G = (V,E)$ be an undirected graph. A dominator coloring of a graph G is a proper coloring in which every vertex of G dominates each vertex of at least one color class. The Dominator chromatic number $\chi_{d}(G)$ is the minimum number of colors required for a dominator coloring of G. In this paper, we found the Dominator chromatic number, Bondage number and Domatic number of some named graphs.

Downloads

Published

01-12-2016

How to Cite

J. Arockia Aruldoss, & G. Gurulakshmi. (2016). Dominator Chromatic Number, Bondage Number and Domatic Number of Some Named Graphs. International Journal of Mathematics And Its Applications, 4(4 (Special Issue), 89–95. Retrieved from http://ijmaa.in/index.php/ijmaa/article/view/1424

Issue

Vol. 4 No. 4 (Special Issue) (2016)

Section

Research Article

License

Copyright (c) 2023 International Journal of Mathematics And its Applications

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.