University of Isfahan Transactions on Combinatorics 2251-8657 6 3 2017 09 01 Common extremal graphs for three inequalities involving domination parameters 1 9 21464 10.22108/toc.2017.21464 EN Vladimir Samodivkin University of Architecture, Civil Engineering and Geodesy (UACEG) Journal Article 2017 01 26 ‎Let $\delta (G)$‎, ‎$\Delta (G)$ and $\gamma(G)$‎ ‎be the minimum degree‎, ‎maximum degree and‎ ‎domination number of a graph $G=(V(G)‎, ‎E(G))$‎, ‎respectively‎. ‎A partition of $V(G)$‎, ‎all of whose classes are dominating sets in $G$‎, ‎is called a domatic partition of $G$‎. ‎The maximum number of classes of‎ ‎a domatic partition of $G$ is called the domatic number of $G$‎, ‎denoted $d(G)$‎. ‎It is well known that‎ ‎$d(G) \leq \delta(G)‎ + ‎1$‎, ‎$d(G)\gamma(G) \leq |V(G)|$ \cite{ch}‎, ‎and $|V(G)| \leq (\Delta(G)‎+‎1)\gamma(G)$ \cite{berge}‎. ‎In this paper‎, ‎we investigate the graphs $G$ for which‎ ‎all the above inequalities become simultaneously equalities‎. https://toc.ui.ac.ir/article_21464_e634e304e912f76a101c385fa80076eb.pdf