Total dominator chromatic number of Mycieleskian graphs
From MaRDI portal
(Redirected from Publication:5354529)
Abstract: A total dominator coloring of a graph is a proper coloring of in which each vertex of the graph is adjacent to every vertex of some color class. The total dominator chromatic number of 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 belongs to between and , and then characterize the family of graphs the their total dominator chromatic numbers are each of them.
Recommendations
Cited in
(13)- Total dominator colorings and total domination in graphs
- Dominator and total dominator colorings in graphs
- On dominator colorings in graphs
- On the double total dominator chromatic number of graphs
- Dominator coloring of Mycielskian graphs
- A counterexample on the conjecture and bounds on \(\chi_{gd}\)-number of Mycielskian of a graph
- Total dominator chromatic number of Kneser graphs
- Total dominator coloring number of middle graphs
- Total dominator total coloring of a graph
- Complexity of total dominator coloring in graphs
- An extensive study on the k-tuple total dominator chromatic number of graphs
- k-tuple total dominator chromatic number and Mycielskian graphs
- Total dominator total chromatic numbers of some graphs
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)