Total dominator total chromatic numbers of cycles and paths

DOI10.1051/RO/2022183zbMATH Open1529.05067OpenAlexW2993721286MaRDI QIDQ6041207FDOQ6041207

Authors A. P. Kazemi, Farshad Kazemnejad

Publication date 26 May 2023

Published in RAIRO - Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

total domination numbertotal graphtotal dominator total chromatic numbertotal dominator total coloringtotal mixed domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)

Abstract: The total dominator total coloring of a graph is a total coloring of the graph such that each object of the graph is adjacent or incident to every object of some color class. The minimum namber of the color classes of a total dominator total coloring of a graph is called the total dominator total chromatic number of the graph. Here, we will find the total dominator chromatic numbers of cycles and paths.

Recommendations

• Total dominator total coloring of a graph
• Total dominator colorings in cycles
• Total dominator colorings in paths
• Dominator and total dominator colorings in graphs

Cited in

(2)

• Total dominator total coloring of a graph
• scientific article; zbMATH DE number 5221413 (Why is no real title available?)

This page was built for publication: Total dominator total chromatic numbers of cycles and paths

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