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].
Recommendations
- Distance domination in graphs
- Distance in graphs
- scientific article; zbMATH DE number 194437
- Distanced graphs
- On distance between graphs
- Distance neighbourhood domination in graphs
- scientific article; zbMATH DE number 125503
- Distance labeling in graphs
- Distance labellings of graphs
- Distance domination and distance irredundance in graphs
Cited in
(27)- A survey of stratified domination in graphs
- Domination with exponential decay
- Bounds on the burning number
- Hereditary equality of domination and exponential domination
- Relating domination, exponential domination, and porous exponential domination
- Stratification and domination in graphs. II
- A vulnerability parameter of networks
- Some new results on distance \(k\)-domination in graphs
- On \((t,r)\) broadcast domination numbers of grids
- Distance domination and distance irredundance in graphs
- Distance domination in graphs with given minimum and maximum degree
- Broadcasts in graphs
- Stratification and domination in graphs with minimum degree two
- Distance domination in graphs
- Distance independent domination in iterated line graphs
- Distance neighbourhood domination in graphs
- Distance domination versus iterated domination
- Exponential domination in subcubic graphs
- scientific article; zbMATH DE number 7560302 (Why is no real title available?)
- Total \(k\)-distance domination critical graphs
- Porous exponential domination number of some graphs
- Distance and related domination parameters in the edge corona product of graphs
- A study of a combination of distance domination and resolvability in graphs
- Disjunctive total domination on the corona and join of graphs
- Bounds on the exponential domination number
- Domination chains in graphs
- Optimal broadcast domination in polynomial time
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)