The k-neighbor domination problem
type: Item
instance of: scholarly article
title: The k-neighbor domination problem
zbMATH Open document ID: 0734.90045
DOI: 10.1016/0377-2217(91)90172-R
author: Shiow-Fen Hwang
author: Gerard Jennhwa Chang
published in: European Journal of Operational Research
publication date: 1991-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 4215667
zbMATH Keywords: k-neighbor domination
zbMATH Keywords: minimum cardinality vertex set
zbMATH Keywords: linear algorithm
zbMATH Keywords: block graphs
zbMATH Keywords: NP-complete
MaRDI profile type: Publication
cites work: Q4773298
cites work: Q4083324
cites work: An upper bound for thek-domination number of a graph
cites work: On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
cites work: Q4711489
cites work: Q3691778
cites work: Q3691779
cites work: Q4198056
cites work: Relations between packing and covering numbers of a tree
cites work: State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
full work available at URL: 0377-2217(91)90172-r
OpenAlex ID: W2056516068
description: scientific article; zbMATH DE number 4215667