Distance neighbourhood domination in graphs
From MaRDI portal
Publication:417063
Recommendations
Cited in
(15)- 3-distance domination numbers of some graphs
- Neighborhood principle driven ICF algorithm and graph distance calculations
- Distance majorization sets in graphs
- scientific article; zbMATH DE number 4091561 (Why is no real title available?)
- Distance domination in graphs
- Secondary and internal distances of sets in graphs
- On distance-defined neighbor-distinguishing sets in graphs
- scientific article; zbMATH DE number 1124605 (Why is no real title available?)
- The extended dominating sets in graphs
- The nm-domination number of a graph
- On dominated graphs
- A contribution to upper domination, irredundance and distance-2 domination in graphs
- Graph Domination in Distance Two
- On orbital domination numbers of graphs
- The step domination number of a graph
This page was built for publication: Distance neighbourhood domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q417063)