scientific article; zbMATH DE number 1124605

From MaRDI portal
Publication:4378634





For \(k\geq 1\), a set \(S\) of vertices of a graph \(G=(V,E)\) is a \(k\)-dominating set of \(G\) if every vertex of \(V-S\) is within distance \(k\) from some vertex of \(S\). The smallest cardinality of a \(k\)-dominating set is called the \(k\)-domination number. The total \(k\)-domination number, the independent \(k\)-domination number and the \(k\)-irredundance number of a graph have the expected definitions. The author surveys a number of results pertaining to these four distance domination parameters. For the entire collection see [Zbl 0883.00011].











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4378634)