R -Domination in Graphs
From MaRDI portal
Publication:4119239
Cited in
(68)- Broadcasts in graphs
- Mim-width. III. Graph powers and generalized distance domination problems
- scientific article; zbMATH DE number 7560302 (Why is no real title available?)
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- Generalized distance domination problems and their complexity on graphs of bounded mim-width
- Labeling algorithms for domination problems in sun-free chordal graphs
- Independent domination in chordal graphs
- Efficient parallel algorithms for r-dominating set and p-center problems on trees
- Approximating the Spanning k-Tree Forest Problem
- Domination and location in acyclic graphs
- Weighted connected domination and Steiner trees in distance-hereditary graphs
- Total domination in block graphs
- On \((t,r)\) broadcast domination numbers of grids
- Parameterized complexity of (d, r)-domination via modular decomposition
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Center location problems on tree graphs with subtree-shaped customers
- An optimal algorithm to find minimum k-hop dominating set of interval graphs
- Computation of minimum d-hop connected dominating set of trees in O(n) time
- Some new results on distance \(k\)-domination in graphs
- Dominating sets for split and bipartite graphs
- Matchings and transversals in hypergraphs, domination and independence in trees
- Domination with decay in triangular matchstick arrangement graphs
- An optimal algorithm for computing minimum k-hop dominating set of permutation graphs
- Domination, independent domination, and duality in strongly chordal graphs
- The domatic number problem
- Linear programming formulation for some generalized domination parameters
- \(k\)-tuple domination in graphs
- Approximating the spanning k-tree forest problem
- An algorithm to find two distance domination parameters in a graph
- Distance and related domination parameters in the edge corona product of graphs
- Distance domination of generalized de Bruijn and Kautz digraphs
- Dominating sets and domatic number of circular arc graphs
- On the k-hop domination numbers of spanning trees of unicyclic graphs
- Minimum dominating cycles in 2-trees
- Covering, Packing and Generalized Perfection
- A linear time algorithm for optimal \(k\)-hop dominating set of a tree
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- On orthogonally guarding orthogonal polygons with bounded treewidth
- An efficient algorithm for distance total domination in block graphs
- Trees with the connected domination number
- Minimum vertex-edge dominating set of permutation graphs
- (t, r)-broadcast domination in graphs
- Vertex fusion under distance constraints
- Distance domination in graphs
- Statistical mechanics of the directed 2-distance minimal dominating set problem
- On independent \([1, 2]\)-sets in trees
- Distance domination in graphs with given minimum and maximum degree
- A generalized linear time algorithm for an optimal \(k\)-distance dominating set of a weighted tree
- An extension of locating-total domination problem and its complexity
- On the \(r\)-domination number of a graph
- The weighted perfect domination problem and its variants
- On covers and domination in trees
- scientific article; zbMATH DE number 7278055 (Why is no real title available?)
- Total domination in graphs
- Structural parameters, tight bounds, and approximation for \((k, r)\)-center
- A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph
- On the computational complexity of centers locating in a graph
- Domination in distance-hereditary graphs
- Optimal broadcast domination in polynomial time
- Domination with exponential decay
- Optimal \((t, r)\) broadcasts on the infinite grid
- An algorithm for the inverse distance-2 dominating set of a graph
- On minimum dominating sets with minimum intersection
- R-domination of block graphs
- Edge-vertex domination on interval graphs
- A study of a combination of distance domination and resolvability in graphs
- Efficient \(( t , r )\) broadcast dominating sets of the triangular lattice
- An optimal algorithm to find minimum k-hop connected dominating set of permutation graphs
This page was built for publication: R -Domination in Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4119239)
