On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
type: Item
instance of: scholarly article
title: On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
zbMATH Open document ID: 0583.05049
DOI: 10.1016/0095-8956(85)90040-1
author: Odile Favaron
published in: Journal of Combinatorial Theory. Series B
publication date: 1985-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 3933123
zbMATH Keywords: k-dependence
zbMATH Keywords: k-dominating set
zbMATH Keywords: dependent set
reviewed by: Rainer Bodendiek
MaRDI profile type: MaRDI publication profile
full work available at URL: 0095-8956(85)90040-1
OpenAlex ID: W2053978154
cites work: Q3691779
Recommended article: On \(k\)-dependent domination
Recommended article: On \(k\)-domination and \(j\)-independence in graphs
Recommended article: Q5454051
Recommended article: Q4711489
Recommended article: On -domination in graphs
Recommended article: Independence andk-domination in graphs
Recommended article: Q5461703
Recommended article: On the Number ofk-Dominating Independent Sets
Recommended article: Q3792724
Recommended article: Inequalities involving independence domination, f-domination, connected and total f-domination numbers
description: scientific article; zbMATH DE number 3933123