Bounds on the connected k-domination number in graphs
Discrete Applied Mathematics
Hi-index | 0.00 |
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.