Total dominator chromatic number in graphs, By Doost Ali Mojdeh

Research

Title	Total dominator chromatic number in graphs
Type	Presentation
Keywords	Graph, Total Domination, Coloring,Total dominator coloring
Researchers	Doost Ali Mojdeh (First researcher) , Esmail Nazari (Second researcher) , Saeid Askari (Third researcher)

Abstract

A given graph G has a total dominator coloring if it has a proper coloring in which each vertex of G is adjacent to every vertex (or all vertices) of some color class. The total dominator chromatic number ) (G t d  of G is the minimum number of color classes in a total dominator coloring of a graph G . In this paper we study the total dominator chromatic number on several classes of graphs.