Abstract
In this article, we present a method to derive inequalities involving various domination parameters in graphs. As an application, we determine several lower bounds for these domination parameters in trees in terms of the order and the number of leaves. Finally, we characterize the classes of extremal trees.
2000 AMS Subject Classification:
Acknowledgements
We would like to thank the anonymous referees for their remarks and suggestions that helped improving the quality of this article.