Bounds on Cost Effective Domination Numbers
A vertex υ in a set S is said to be cost effective if it is adjacent to at least as many vertices in V\S as it is in S and is very cost effective if it is adjacent to more vertices in V\S than to vertices in S. A dominating set S is (very) cost effective if every vertex in S is (very) cost effective. The minimum cardinality of a (very) cost effective dominating set of G is the (very) cost effective domination number of G. Our main results include a quadratic upper bound on the very cost effective domination number of a graph in terms of its domination number. The proof of this result gives a linear upper bound for hereditarily sparse graphs which include trees. We show that no such linear bound exists for graphs in general, even when restricted to bipartite graphs. Further, we characterize the extremal trees attaining the bound. Noting that the very cost effective domination number is bounded below by the domination number, we show that every value of the very cost effective domination number between these lower and upper bounds for trees is realizable. Similar results are given for the cost effective domination number.
Haynes, Teresa W.; Hedetniemi, Stephen T.; McCoy, Tabitha L.; and Rodriguez, Tony K.. 2016. Bounds on Cost Effective Domination Numbers. Quaestiones Mathematicae. Vol.39(6). 773-783. https://doi.org/10.2989/16073606.2016.1167133 ISSN: 1607-3606