On dominator colorings in graphs

Title: On dominator colorings in graphs
Creator: Arumugam, S.; Bagga, Jay; Chandrasekar, K. Raja
Relation: Proceedings of the Indian Academy of Sciences-Mathematical Sciences Vol. 122, Issue 4, p. 561-571
Publisher Link: http://dx.doi.org/10.1007/s12044-012-0092-5
Publisher: Indian Academy of Sciences
Resource Type: journal article
Date: 2012
Description: A dominator coloring of a graph G is a proper coloring of G in which every vertex dominates every vertex of at least one color class. The minimum number of colors required for a dominator coloring of G is called the dominator chromatic number of G and is denoted by χd(G). In this paper we present several results on graphs with χd(G) = χ(G) and χd(G) = γ(G) where χ(G) and γ(G) denote respectively the chromatic number and the domination number of a graph G. We also prove that if μ(G) is the Mycielskian of G, then χd(G) + 1 ≤ χd(μ(G)) ≤ χd(G) + 2.
Subject: dominator coloring; dominator chromatic number; chromatic number; domination number
Identifier: http://hdl.handle.net/1959.13/1336731
Identifier: uon:27687
Identifier: ISSN:0253-4142
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format