The independent domination number\(\gamma ^i(G)\) of a graph G is the maximum, over all independent sets I, of the minimal number of vertices needed to dominate I. It is known (Aharoni et al. in Combinatorica 22:335–343, 2002) that in chordal graphs \(\gamma ^i\) is equal to \(\gamma \), the ordinary domination number. The weighted version of this result is not true, but we show that it does hold for interval graphs, and for the intersection graphs of subtrees of a given tree, where each subtree is a single edge.
Graph Independence Domination Chordal graphs Trees
This is a preview of subscription content, log in to check access.