A Note on Inequalities for Three Domination Parameters

In this short paper, we establish relations between the domination number $\gamma$, the total domination number ${\gamma }_t$, and the connected domination number ${\gamma }_c$ of a graph. In particular, we prove upper and lower bounds for ${\gamma }_t$ in terms of $\gamma$ and ${\gamma }_c$.