Dominator chromatic number of grid graph
Downloads
DOI:
https://doi.org/10.26637/MJM0804/0026Abstract
Let \(G\) be a graph. A dominator coloring of \(G\) is a proper coloring in which every vertex of G dominates at least one color class. The dominator chromatic number of \(G\) is denoted by \(\chi_d(G)\) and is defined by the minimum number of colors needed in a dominator coloring of \(G\). In this paper, we obtain dominator chromatic number of grid graphs.
Keywords:
Dominator chromatic number, grid graph.Mathematics Subject Classification:
Mathematics- Pages: 1493-1496
- Date Published: 01-10-2020
- Vol. 8 No. 04 (2020): Malaya Journal of Matematik (MJM)
F.Harrary, Graph Theory, Addition- wesley Reading, Mass, 1969.
Gera-R, Rasmussen-c and Horton-S, Dominator coloring and safe clique partitions, Congr. Numer., 181(2006), $19-32$.
S.M. Dedetniemi, S.T. Hedetniemi, A.A. Mcrae, J.R.S. Blair, Dominator coloring of graphs, 2006, (pre print).
TerasaW.Haynes, Stephen T.Hedetniemi, Peter J.Slater, Domination in Graphs, Marcel Dekker, New York, 1998.
TerasaW.Haynes, Stephen T.Hedetniemi, Peter J.Slater, Domination in Graphs - Advanced Topics, Marcel Dekker, New York, 1998.
S.Gravier, M. Mollard, on domination numbers of Cartesian product of paths, Discrete Appl. Math., 80 (1997), $247-250$.
T.Y. Chang, W.E. Clark, The domination number of the $5 times n$ and $6 times n$ grid graphs, J. Graph Theory, 17(1)(1993), $81-107$.
M.S.Jacobson, L.F.Kinch, on the domination number of products of a graph I, Ars Combin., 10(1983), 33-44.
- NA
Similar Articles
- Jimly Manuel, Bindhu K Thomas, Digraph homomorphisms on \(Z_n\)-digraph , Malaya Journal of Matematik: Vol. 8 No. 04 (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.
