An alternate C++ programme for the total dominator chromatic number of ladder graphs
Abstract
A total dominator coloring of a graph \(G=(V, E)\) without isolated vertices is a proper coloring of \(G\) in which each vertex of \(\mathrm{G}\) is adjacent to every vertex of some color class. The total dominator chromatic number of \(G\) is the minimum number of colors among all total dominator colorings of \(\mathrm{G}\) and is denoted by \(\chi_{t d}(G)\). In this paper, we provide \(\mathrm{C}_{++}\) programme for the total dominator chromatic number of Ladder graphs.
Keywords:
Total dominator coloring, Total dominator chromatic number, ColoringMathematics Subject Classification:
Mathematics- Pages: 602-607
- Date Published: 01-04-2020
- Vol. 8 No. 02 (2020): Malaya Journal of Matematik (MJM)
A. Vijayalekshmi, Total dominator colorings in paths, International Journal of Mathematical Combinatorics, 2(2012), 89-95.
A. Vijayalekshmi, Total dominator colorings in cycles, International Journal of Mathematical Combinatorics, 4(2012), 92-96.
A. Vijayalekshmi and J.VirginAlangaraSheeba, Total dominator chromatic number of Paths, Cycles and Ladder graphs, International Journal of Contemporary Mathematical Sciences, 13(5)(2018), 199-204.
F. Harrary, Graph Theory, Addition-Wesley, Reading Mass, 1969.
M.I. Jinnah and A. Vijayalekshmi, Total Dominator Colorings in Graphs, Ph.D Thesis, University of Kerala, 2010.
Terasa W. Haynes, Stephen T. Hedetniemi, Peter J. Slater, Domination in Graphs, Marcel Dekker, New York, 1998.
- NA
Similar Articles
- Rinsy Thomas, D. Susha, MAP/M/1 queue with M-policy of transfer of customers from pool to buffer , Malaya Journal of Matematik: Vol. 8 No. 02 (2020): Malaya Journal of Matematik (MJM)
You may also start an advanced similarity search for this article.
Metrics
Published
How to Cite
Issue
Section
License
Copyright (c) 2020 MJM
This work is licensed under a Creative Commons Attribution 4.0 International License.
