An extensive study on the k-tuple total dominator chromatic number of graphs
摘要
Let k be a positive integer. A k-tuple total dominator coloring of a graph G (abbreviated as kTD-coloring) is a proper coloring of G such that each vertex of the graph is adjacent to every vertex of k color classes. The k-tuple total dominator chromatic number, denoted by