On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
The author proves the unpublished conjecture of J. F. Fink and M. S. Jacobsen. It is: For any positive integer k and any simple graph G, \(\gamma_ k(G)\leq \beta_ k(G)\), where \(\gamma_ k(G)\) and \(\beta_ k(G)\) are the minimum order of a k-dominating set in G and the maximum order of a k-dependent set in G, respectively.
scientific article; zbMATH DE number 3933123