Distance domination and distance irredundance in graphs
From MaRDI portal
Publication:2372879
zbMATH Open1122.05070MaRDI QIDQ2372879FDOQ2372879
Authors: Adriana Hansberg, Dirk Meierling, Lutz Volkmann 
Publication date: 16 July 2007
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/128038
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Cited In (21)
- On the distance domination number of bipartite graphs
- A new lower bound for the irredundance number of a tree
- Distance irredundance and connected domination numbers of a graph
- Title not available (Why is that?)
- Graph Domination in Distance Two
- Distance domination versus iterated domination
- Distance-\(k\) locating-dominating sets in graphs
- Lower bounds on the distance domination number of a graph
- \(k\)-distance enclaveless number of a graph
- Title not available (Why is that?)
- Lower bound on the distance \(k\)-domination number of a tree
- Distance domination in graphs with given minimum and maximum degree
- Exponential domination in subcubic graphs
- Higher independence complexes of graphs and their homotopy types
- A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph
- Bounds on the exponential domination number
- Domination on hyperbolic graphs
- On distance \(r\)-dominating and \(2r\)-independent sets in sparse graphs
- A lower bound for the distance \(k\)-domination number of trees
- Connected domination
- The ratio of the distance irredundance and domination numbers 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)
