Distance domination in graphs
From MaRDI portal
Publication:3384610
Recommendations
Cites work
- R -Domination in Graphs
- A distributed algorithm for minimum distance-k domination in trees
- A lower bound for the distance \(k\)-domination number of trees
- A note on distance domination numbers of graphs
- A note on total domination
- A survey of Nordhaus-Gaddum type relations
- An \(O(n\log n)\)-time algorithm for the \(k\)-center problem in trees
- An algorithm to find two distance domination parameters in a graph
- An efficient algorithm to solve the distance \(k\)-domination problem on permutation graphs
- An incremental version of the \(k\)-center problem on boundary of a convex polygon
- Average distances and distance domination numbers
- Clustering and domination in perfect graphs
- Competitive self-stabilizing \(k\)-clustering
- Computing k centers over streaming data for small k
- Critical concepts in domination
- Distance domination and generalized eccentricity in graphs with given minimum degree
- Distance domination in graphs with given minimum and maximum degree
- Distance domination versus iterated domination
- Distance-2 domatic numbers of grid graphs
- Dominating Sets in Chordal Graphs
- Efficient algorithms for the one-dimensional \(k\)-center problem
- Factor d-domatic colorings of graphs
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
- Fractional distance domination in graphs
- Generalized distance domination problems and their complexity on graphs of bounded mim-width
- Graph classes with structured neighborhoods and algorithmic applications
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Hardness of computing width parameters based on branch decompositions over the vertex set
- scientific article; zbMATH DE number 2185578 (Why is no real title available?)
- scientific article; zbMATH DE number 4130427 (Why is no real title available?)
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 3914370 (Why is no real title available?)
- scientific article; zbMATH DE number 4049086 (Why is no real title available?)
- scientific article; zbMATH DE number 4063149 (Why is no real title available?)
- scientific article; zbMATH DE number 146666 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 617203 (Why is no real title available?)
- scientific article; zbMATH DE number 638684 (Why is no real title available?)
- scientific article; zbMATH DE number 716402 (Why is no real title available?)
- scientific article; zbMATH DE number 1124605 (Why is no real title available?)
- scientific article; zbMATH DE number 1124606 (Why is no real title available?)
- scientific article; zbMATH DE number 1934392 (Why is no real title available?)
- scientific article; zbMATH DE number 205335 (Why is no real title available?)
- scientific article; zbMATH DE number 749270 (Why is no real title available?)
- scientific article; zbMATH DE number 798658 (Why is no real title available?)
- scientific article; zbMATH DE number 844146 (Why is no real title available?)
- scientific article; zbMATH DE number 871183 (Why is no real title available?)
- scientific article; zbMATH DE number 238431 (Why is no real title available?)
- scientific article; zbMATH DE number 3284071 (Why is no real title available?)
- scientific article; zbMATH DE number 3358515 (Why is no real title available?)
- scientific article; zbMATH DE number 4189776 (Why is no real title available?)
- Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis
- Lower bound on the distance k-domination number of a tree
- Lower bounds on the distance domination number of a graph
- Mim-width. I. Induced path problems
- Mim-width. II. The feedback vertex set problem
- Mim-width. III. Graph powers and generalized distance domination problems
- New upper bounds on the distance domination numbers of grids
- On k-domatic numbers of graphs
- On \((t,r)\) broadcast domination numbers of grids
- On Complementary Graphs
- On coupon colorings of graphs
- On domination and independent domination numbers of a graph
- On packing and covering numbers of graphs
- On the tractability of optimization problems on \(H\)-graphs
- Planar Formulae and Their Uses
- Relations between packing and covering numbers of a tree
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
- State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
- The k-domatic number of a graph
- The diversity of domination
- Thoroughly dispersed colorings
- Total domination in graphs
- Vertex domination-critical graphs
Cited in
(34)- A note on distance-dominating cycles
- Graphs having distance-\(n\) domination number half their order
- Distance domination in graphs with given minimum and maximum degree
- Distance paired domination numbers of graphs
- Distance domination-critical graphs
- Distance preserving Ramsey graphs
- Bounds for distance domination numbers of graphs
- Distance independent domination in iterated line graphs
- On distance connected domination numbers of graphs.
- A note on distance domination numbers of graphs
- Distance neighbourhood domination in graphs
- scientific article; zbMATH DE number 1124605 (Why is no real title available?)
- Distance domination versus iterated domination
- scientific article; zbMATH DE number 2077664 (Why is no real title available?)
- Lower bounds on the distance domination number of a graph
- DISTANCE-k TOTAL DOMINATION POLYNOMIAL OF SOME GRAPHS
- Fractional distance domination in graphs
- scientific article; zbMATH DE number 2104819 (Why is no real title available?)
- scientific article; zbMATH DE number 798658 (Why is no real title available?)
- On the distance domination number of bipartite graphs
- Distance-k locating-dominating sets in graphs
- Graph Domination in Distance Two
- Distance $k$-domination in some cycle related graphs
- The extended dominating sets in graphs
- 3-distance domination numbers of some graphs
- Distance and related domination parameters in the edge corona product of graphs
- The d-distance p-packing domination number: complexity, cycles, and trees
- Revisiting d-distance (independent) domination in trees and in bipartite graphs
- (t, r)-broadcast domination in graphs
- The complexity of distance-r dominating set reconfiguration
- A study of a combination of distance domination and resolvability in graphs
- Parameterized complexity of (d, r)-domination via modular decomposition
- The complexity of distance-\(r\) dominating set reconfiguration
- Deterministic local problems in radio networks: on the impact of local domination and a bit of advice
This page was built for publication: Distance domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3384610)
