Distance Domination in Graphs
From MaRDI portal
Publication:3384610
DOI10.1007/978-3-030-51117-3_7zbMath1479.05276OpenAlexW2973060426MaRDI QIDQ3384610
Publication date: 15 December 2021
Published in: Topics in Domination in Graphs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-51117-3_7
Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Competitive self-stabilizing \(k\)-clustering
- Graph classes with structured neighborhoods and algorithmic applications
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
- Distance domination versus iterated domination
- Efficient algorithms for the one-dimensional \(k\)-center problem
- On domination and independent domination numbers of a graph
- An incremental version of the \(k\)-center problem on boundary of a convex polygon
- Average distances and distance domination numbers
- A note on total domination
- Clustering and domination in perfect graphs
- On packing and covering numbers of graphs
- Relations between packing and covering numbers of a tree
- The diversity of domination
- Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis
- Factor \(d\)-domatic colorings of graphs
- An algorithm to find two distance domination parameters in a graph
- A survey of Nordhaus-Gaddum type relations
- Mim-width. I. Induced path problems
- Critical concepts in domination
- Mim-width. II. The feedback vertex set problem
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
- Mim-width. III. Graph powers and generalized distance domination problems
- On \((t,r)\) broadcast domination numbers of grids
- On coupon colorings of graphs
- Distance domination in graphs with given minimum and maximum degree
- A lower bound for the distance \(k\)-domination number of trees
- COMPUTING k CENTERS OVER STREAMING DATA FOR SMALL k
- The k-domatic number of a graph
- Graph-theoretic parameters concerning domination, independence, and irredundance
- On Complementary Graphs
- On $k$-domatic numbers of graphs
- State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
- Vertex domination-critical graphs
- Total domination in graphs
- Planar Formulae and Their Uses
- Dominating Sets in Chordal Graphs
- R -Domination in Graphs
- Thoroughly dispersed colorings
- Lower Bounds on the Distance Domination Number of a Graph
- Fractional distance domination in graphs
- New Upper Bounds on the Distance Domination Numbers of Grids
- An efficient algorithm to solve the distancek-domination problem on permutation graphs
- Distance domination and generalized eccentricity in graphs with given minimum degree
- An O(n log n)-Time Algorithm for the k-Center Problem in Trees
- A Distributed Algorithm for Minimum Distance-k Domination in Trees
- Hardness of computing width parameters based on branch decompositions over the vertex set
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Distance Domination in Graphs
