R-domination of block graphs
From MaRDI portal
Publication:1171499
DOI10.1016/0167-6377(82)90024-4zbMath0498.90023OpenAlexW1969092612MaRDI QIDQ1171499
Gerard Jennhwa Chang, Nemhauser, George I.
Publication date: 1982
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(82)90024-4
dominating setblock graphslinear algorithmminimum cardinality vertex setfacility location on graphsk-domination problempolynomial-algorithmR-domination problem
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Inventory, storage, reservoirs (90B05)
Related Items (8)
The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs ⋮ Labeling algorithms for domination problems in sun-free chordal graphs ⋮ An algorithm to find two distance domination parameters in a graph ⋮ Total domination in block graphs ⋮ The bottleneck independent domination on the classes of bipartite graphs and block graphs. ⋮ On minimum dominating sets with minimum intersection ⋮ \(k\)-power domination in block graphs ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear algorithm for the domination number of a tree
- Parallel concepts in graph theory
- On the computational power of pushdown automata
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- Dominating Sets in Chordal Graphs
- R -Domination in Graphs
This page was built for publication: R-domination of block graphs