On a conjecture of Fink and Jacobson concerning k-domination and k- dependence (Q1069959)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On a conjecture of Fink and Jacobson concerning k-domination and k- dependence |
scientific article; zbMATH DE number 3933123
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a conjecture of Fink and Jacobson concerning k-domination and k- dependence |
scientific article; zbMATH DE number 3933123 |
Statements
On a conjecture of Fink and Jacobson concerning k-domination and k- dependence (English)
0 references
1985
0 references
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.
0 references
k-dependence
0 references
k-dominating set
0 references
dependent set
0 references
0 references
0 references
0.88750494
0 references
0.8853908
0 references
