Weighted Domination of Independent Sets
Sign Up to like & getrecommendations! Published in 2019 at "Graphs and Combinatorics"
DOI: 10.1007/s00373-019-02024-3
Abstract: The independent domination number$$\gamma ^i(G)$$γ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… read more here.
Keywords: weighted domination; number; domination independent; domination ... See more keywords