Total dominator coloring number of middle graphs

From MaRDI portal
Publication:6174159

DOI10.1142/S1793830922500768zbMATH Open1516.05066arXiv2104.12305OpenAlexW3157287446MaRDI QIDQ6174159FDOQ6174159


Authors: Farshad Kazemnejad, Behnaz Pahlavsay, Elisa Palezzato, Michele Torielli Edit this on Wikidata


Publication date: 14 July 2023

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

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 article, we study the total dominator coloring on middle graphs by giving several bounds for the case of general graphs and trees. Moreover, we calculate explicitely the total dominator chromatic number of the middle graph of several known families of graphs.


Full work available at URL: https://arxiv.org/abs/2104.12305




Recommendations




Cites Work


Cited In (18)





This page was built for publication: Total dominator coloring number of middle graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6174159)