Some upper bounds for the product of the domination number and the chromatic number of a graph (Q685554): Difference between revisions

For a graph \(G\), let \(n\), \(\delta\), \(\gamma\), \(\chi\) denote the order, the minimum degree, the domination number and the chromatic number of \(G\), respectively. Improving results of \textit{D. Gernert} [Inequalities between domination number and the chromatic number of a graph, Discrete Math. 76, No. 2, 151-153 (1989; Zbl 0674.05030)] and combining several known inequalities the authors prove: If \(G\) is a connected regular graph with \(n\geq 6\), different from the cycle \(C_ 7\), then \(\gamma\chi\leq {(n+1)^ 2\over 8}\). If \(G\) is a connected graph with \(\delta\geq 2\), then \(\gamma\chi\leq{\delta\over 8(\delta-1)} (n+1)^ 2\). If \(G\) is a connected graph with \(\delta=2\), then \(\gamma\chi\leq{2\over 9} (n+1)^ 2\). Examples show that the second resp. third bound is asymptotically best possible if \(\delta=3\) resp. \(\delta=2\).