Distance domination versus iterated domination
From MaRDI portal
Recommendations
- Distance domination in graphs
- Distance independent domination in iterated line graphs
- Distance domination and distance irredundance in graphs
- On domination number and distance in graphs
- scientific article; zbMATH DE number 146666
- scientific article; zbMATH DE number 844146
- Bounds for distance domination numbers of graphs
- Distance domination in partitioned graphs
- Graph Domination in Distance Two
- Distance \(d\)-domination games
Cites work
- scientific article; zbMATH DE number 1124605 (Why is no real title available?)
- scientific article; zbMATH DE number 2188424 (Why is no real title available?)
- A survey of hereditary properties of graphs
- Complete description of forbidden subgraphs in the structural domination problem
- Graph Domination in Distance Two
- Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs
Cited in
(6)
This page was built for publication: Distance domination versus iterated domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442389)