Dominator color class dominating sets in Grid graphs

Authors

  • Dr. A. Vijayalekshmi Associate Professor, Department of Mathematics, S.T. Hindu College, Nagercoil,– 629002,Tamil Nadu, India
  • S. G. Vidhya Research Scholar,Department of Mathematics,S.T. Hindu College,Nagercoil ,Tamil Nadu,India) – 629002

Keywords:

Chromatic number, Domination number, Color Class Dominating set, Domination Color Class Dominating set, Color Class Domination number, Dominator ColorClass Domination number

Abstract

Let  be a graph. Let  be a proper coloring of .  is called dominator color class dominating set if each vertex  in  is dominated by a color class and each    is dominated by  a vertex  in . The dominator color class domination number is the minimum cardinality taken over all dominator color class dominating sets in  is denoted by . In this paper, we obtain  for Grid graph.

Downloads

Published

2024-09-20

How to Cite

Dr. A. Vijayalekshmi, & S. G. Vidhya. (2024). Dominator color class dominating sets in Grid graphs. Journal of Computational Analysis and Applications (JoCAAA), 33(08), 385–389. Retrieved from https://eudoxuspress.com/index.php/pub/article/view/1300

Issue

Section

Articles

Similar Articles

<< < 4 5 6 7 8 9 10 11 12 13 > >> 

You may also start an advanced similarity search for this article.