New bounds on the double domination number of trees

From MaRDI portal
Publication:2133403





The paper establishes improved upper and lower bounds for the double-domination number of trees. The proof uses induction and elementary combinatorial arguments. Two short corollaries are also given: trees attaining the upper bound are the ones with a double-domination number equal to the usual domination number, and a new upper bound for independent domination number of trees follows immediately from the known results.











This page was built for publication: New bounds on the double domination number of trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2133403)