Total dominator colorings and total domination in graphs
Given a graph \(G\), a total dominator coloring is a proper coloring of the vertices of \(G\) in which each vertex is adjacent to every vertex of some color class. The total dominator chromatic number \(\chi_{d}^{t}(G)\) of \(G\) is the minimum number of colors among all total dominator colorings of \(G\). A total dominating set of \(G\) is a set \(S\) of vertices such that every vertex in \(G\) is adjacent to at least one vertex in \(S\). The total domination number \(\gamma_{t}(G)\) is the minimum cardinality of a total dominating set of \(G\). The author shows that every graph \(G\) with no isolated vertex satisfies \(\gamma_{t}(G) \leq \chi_{d}^{t}(G) \leq \gamma_{t}(G) + \chi(G)\), where \(\chi(G)\) denotes the chromatic number of \(G\). He establishes properties of total dominator colorings in trees, and characterizes those trees \(T\) for which \(\gamma_{t}(T) = \chi_{d}^{t}(T)\). Finally, he proves that if \(T\) is a tree of \(n \geq 2\) vertices, then \(\chi_{d}^{t}(T) \leq 2(n+1)/3\), and he characterizes those trees achieving equality in this bound.
- A survey of selected recent results on total domination in graphs
- Dominator colorings and safe clique partitions
- Dominator colorings in some classes of graphs
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- Total domination in graphs
- Total domination in graphs
- Total dominator chromatic number of Mycieleskian graphs
- On some domination colorings of graphs
- Compelling colorings: a generalization of the dominator chromatic number
- On the dominator colorings in trees
- Total dominator colorings in caterpillars
- Dominator and total dominator colorings in graphs
- Domination in transitive colorings of tournaments
- Total dominator colorings in paths
- Total dominator colorings in cycles
- On strict strong coloring of graphs
- Chromatic total domination in graphs
- Total dominator chromatic number of k-subdivision of graphs
- Dominator and total dominator coloring of circulant graph Cn(1, 2)
- On the double total dominator chromatic number of graphs
- A note on global dominator coloring of graphs
- Total dominator chromatic number of a graph
- Linear time algorithm for dominator chromatic number of trestled graphs
- Dominator coloring and CD coloring in almost cluster graphs
- 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
- Dominator colorings in some classes of graphs
- Dissimilarity between dominator and total dominator coloring of certain graphs
- An extensive study on the k-tuple total dominator chromatic number of graphs
- k-tuple total dominator chromatic number and Mycielskian graphs
- Dominator coloring and CD coloring in almost cluster graphs
- Total dominator total chromatic numbers of some graphs
- Domination and dominator colorings in planar graphs with small diameter
This page was built for publication: Total dominator colorings and total domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2354609)
