Distance domination and distance irredundance in graphs
From MaRDI portal
Publication:2372879
Recommendations
Cited in
(21)- Higher independence complexes of graphs and their homotopy types
- Distance domination in graphs with given minimum and maximum degree
- A new lower bound for the irredundance number of a tree
- Lower bound on the distance \(k\)-domination number of a tree
- A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph
- Lower bounds on the distance domination number of a graph
- Domination on hyperbolic graphs
- Bounds on the exponential domination number
- Distance domination versus iterated domination
- scientific article; zbMATH DE number 798658 (Why is no real title available?)
- Distance irredundance and connected domination numbers of a graph
- On distance \(r\)-dominating and \(2r\)-independent sets in sparse graphs
- On the distance domination number of bipartite graphs
- scientific article; zbMATH DE number 1124605 (Why is no real title available?)
- A lower bound for the distance \(k\)-domination number of trees
- Distance-\(k\) locating-dominating sets in graphs
- Graph Domination in Distance Two
- The ratio of the distance irredundance and domination numbers of a graph
- Exponential domination in subcubic graphs
- Connected domination
- \(k\)-distance enclaveless number of a graph
This page was built for publication: Distance domination and distance irredundance in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2372879)
