On Domatic and Total Domatic Numbers of Product Graphs
From MaRDI portal
Abstract: A emph{domatic} (emph{total domatic}) emph{-coloring} of a graph is an assignment of colors to the vertices of such that each vertex contains vertices of all colors in its closed neighborhood (neighborhood). The emph{domatic} (emph{total domatic}) emph{number} of , denoted (), is the maximum for which has a domatic (total domatic) -coloring. In this paper, we show that for two non-trivial graphs and , the domatic and total domatic numbers of their Cartesian product is bounded above by and below by . Both these bounds are tight for an infinite family of graphs. Further, we show that if is bipartite, then is bounded below by and is bounded below by . These bounds give easy proofs for many of the known bounds on the domatic and total domatic numbers of hypercubes cite{chen,zel4} and the domination and total domination numbers of hypercubes cite{har,joh} and also give new bounds for Hamming graphs. We also obtain the domatic (total domatic) number and domination (total domination) number of -dimensional torus with some suitable conditions to each , which turns out to be a generalization of a result due to Gravier cite{grav2} %[emph{Total domination number of grid graphs}, Discrete Appl. Math. 121 (2002) 119-128] and give easy proof of a result due to Klavv{z}ar and Seifter cite{sand}.
This page was built for publication: On Domatic and Total Domatic Numbers of Product Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6363245)