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 of a graph is the minimum number of color classes in a total dominator coloring. In this paper, we study the total dominator coloring on middle graphs by giving several bounds for the case of general graphs and trees. Moreover, we calculate explicitly the total dominator chromatic number of the middle graph of several known families of graphs.
Original language | English (US) |
---|---|
Article number | 2250076 |
Journal | Discrete Mathematics, Algorithms and Applications |
Volume | 15 |
Issue number | 2 |
DOIs | |
State | Published - Feb 1 2023 |
Externally published | Yes |
Keywords
- middle graph
- total domination number
- total dominator chromatic number
- Total dominator coloring
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics