Total dominator chromatic number of Mycieleskian graphs

From MaRDI portal
(Redirected from Publication:5354529)



Abstract: A total dominator coloring of a graph G is a proper coloring of G in which each vertex of the graph is adjacent to every vertex of some color class. The total dominator chromatic number chidt(G) of G is the minimum number of color classes in a total dominator coloring of it. In [Total dominator chromatic number of a graph, submitted] the author initialed to study this number in graphs and obtained some important results. Here, we continue it in Mycieleskian graphs. We show that the total dominator chromatic number of the Mycieleskian of a graph G belongs to between chidt(G)+1 and chidt(G)+2, and then characterize the family of graphs the their total dominator chromatic numbers are each of them.












This page was built for publication: Total dominator chromatic number of Mycieleskian graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5354529)