On \(k\)-dependent domination (Q1598844): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Odile Favaron / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Sandra M. Hedetniemi / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Stephen T. Hedetniemi / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Douglas F. Rall / rank | |||
Normal rank |
Revision as of 15:32, 11 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On \(k\)-dependent domination |
scientific article |
Statements
On \(k\)-dependent domination (English)
0 references
28 May 2002
0 references
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.
0 references
dominating set
0 references
\(k\)-dependent
0 references
irredundance
0 references