On \(k\)-dependent domination
type: Item
instance of: scholarly article
title: On \(k\)-dependent domination
zbMATH Open document ID: 0994.05108
DOI: 10.1016/S0012-365X(01)00236-9
published in: Discrete Mathematics
publication date: 2002-05-28T00:00:00Z
review text: Let \(G = (V,E)\) be a graph and \(D\) a subset of \(V\). We say \(D\) is a dominating set if every vertex of \(V-D\) is adjacent to a vertex in \(D\). It is \(k\)-dependent if the vertices in the subgraph of \(G\) induced by \(D\) have maximum degree \(k\). The authors establish relationships between \(k\)-dependent domination and the standard concepts of domination and irredundance and study related complexity questions.
reviewed by: Katherine Heinrich
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 1746278
zbMATH Keywords: dominating set
zbMATH Keywords: \(k\)-dependent
zbMATH Keywords: irredundance
author: Odile Favaron
author: Sandra M. Hedetniemi
author: Stephen T. Hedetniemi
author: Douglas F. Rall
MaRDI profile type: Publication
Wikidata QID: Q126550383
description: scientific article; zbMATH DE number 1746278