Total dominator coloring number of middle graphs
From MaRDI portal
Publication:6174159
DOI10.1142/s1793830922500768zbMath1516.05066arXiv2104.12305OpenAlexW3157287446MaRDI QIDQ6174159
Michele Torielli, Behnaz Pahlavsay, Elisa Palezzato, Farshad Kazemnejad
Publication date: 14 July 2023
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.12305
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Traversability and connectivity of the middle graph of a graph
- Domination for Latin square graphs
- 3-tuple total domination number of Rook's graphs
- Total dominator colorings and total domination in graphs
- Total Domination in Graphs
- Total dominator chromatic number of a graph
This page was built for publication: Total dominator coloring number of middle graphs