Dominated and dominator colorings over (edge) corona and hierarchical products (Q2660830)

Let \(G = (V, E)\) be a graph. A dominator coloring of a graph \(G\) is a proper vertex coloring with the additional property that every vertex \(u\) of \(G\) forms a color class, or \(u\) is adjacent to all vertices of at least one color class. The smallest number of colors needed for a dominator coloring of \(G\) is the dominator chromatic number \(\chi_d ( G )\) of \(G\). A proper coloring of a graph \(G\) is a dominated coloring if each color class is dominated by at least one vertex. The minimum number of colors needed for a dominated coloring of \(G\) is the dominated chromatic number \(\chi_{\mathrm{dom}}( G )\) of \(G\). If \(G\) is a graph its order is denoted with \(n( G )\) and its size with \(m ( G )\). For a positive integer \(n\), \([ n ] = \{ 1,\dots,n \}\). The chromatic number of \(G\) is denoted with \(\chi( G )\). The corona product \(G\circ H\) of graphs \(G\) and \(H\) is obtained from one copy of \(G\) and \(n ( G )\) copies of \(H\) by joining each \(i\)th vertex of the copy of \(H\), \(i \in [ n ( G )]\), to the \(i\)th vertex of \(G\).\\ The edge corona \(G \diamond H\) of graphs \(G\) and \(H\) is obtained by taking one copy of \(G\) and \(m ( G )\) disjoint copies of \(H\) one-to-one assigned to the edges of \(G\), and for every edge \(gg^\prime \in E ( G )\) joining \(g\) and \(g^\prime\) to every vertex of the copy of \(H\) associated to \(gg^\prime\). The matching number and vertex cover number of a graph \(G\) are denoted with \(\alpha^\prime(G)\) and \(\beta(G)\) respectively. The hierarchical products of family of graphs is defined in this paper. The authors' main results are on dominator coloring and dominated coloring of corona of two graphs, edge corona of two graphs and finally the dominator coloring of hierarchical products of family of graphs. The main results are as follows: \begin{itemize} \item[1.] If \(G\) and \(H\) are graphs, then \(\chi_d (G \circ H) = n (G ) + \chi(H)\). \item[2.] If \(G\) and \(H\) are graphs, then \(\chi_d (G \diamond H) = \beta(G ) + \chi(H) + 1\). \item[3.] If \(G\) is a graph without pendant vertices, then \(\chi_{\mathrm{dom}} (G \diamond H) \ge \alpha'(G ) \chi(H) + \chi_{\mathrm{dom}}(G )\). \item[4.] If \(G\) has \(k\) pendant vertices, then \(\chi_{\mathrm{dom}} (G \diamond H) \ge \alpha^\prime(G ) \chi(H)+k\). \item[5.] If \(G\) and \(H\) are graphs, then \(\chi_{\mathrm{dom}} (G \diamond H)\le \chi_{\mathrm{dom}}(G ) + \beta(G ) \chi(H)\), with equality when \(G\) is bipartite graph without pendant vertices. \item[6.] If \(\{ G_i = (V_i , E_i ) \}_{i =1}^N\) is a family of graphs (with a root vertex), then \(\chi_{d}(G_N \sqcap \cdots \sqcap G_2 \sqcap G_2) \le \chi_{d}(G_1)\Pi_{i=2}^Nn(G_i)\). \end{itemize}