Roman domination on strongly chordal graphs
From MaRDI portal
Publication:385486
DOI10.1007/S10878-012-9482-YzbMATH Open1282.90217OpenAlexW2028333952MaRDI QIDQ385486FDOQ385486
Chun-Hung Liu, Gerard Jennhwa Chang
Publication date: 2 December 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9482-y
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Roman domination in graphs.
- Defending the Roman Empire---a new strategy
- Algorithmic graph theory and perfect graphs
- Extremal Problems for Roman Domination
- Efficient algorithms for Roman domination on some classes of graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- A characterization of Roman trees
- A note on Roman domination in graphs
- Domination, independent domination, and duality in strongly chordal graphs
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- R<scp>OMAN DOMINATION</scp>: a parameterized perspective†
- Roman domination on 2-connected graphs
- Independent domination in chordal graphs
- Defending the Roman Empire from multiple attacks
- The weighted independent domination problem is NP-complete for chordal graphs
- Upper bounds on Roman domination numbers of graphs
Cited In (66)
- Total Roman domination for proper interval graphs
- The Roman domatic problem in graphs and digraphs: a survey
- Total Roman domination in the lexicographic product of graphs
- Hardness results of global Roman domination in graphs
- Algorithmic aspects of total Roman and total double Roman domination in graphs
- Hardness results of global Roman domination in graphs
- Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties
- Roman \(k\)-domination: hardness, approximation and parameterized results
- On the signed Roman \(k\)-domination: complexity and thin torus graphs
- Total Roman domination on the digraphs
- A Nordhaus–Gaddum bound for Roman domination
- Total Roman domatic number of a graph
- On the Roman domination stable graphs
- Roman Domination in Graphs
- Total 2-rainbow domination numbers of trees
- Computing Roman domatic number of graphs
- On the total Roman domination stability in graphs
- Quasi-total Roman reinforcement in graphs
- Large hypertree width for sparse random hypergraphs
- A note on Roman domination of digraphs
- Quasi-total Roman bondage number in graphs
- On the differential and Roman domination number of a graph with minimum degree two
- Algorithm and hardness results in double Roman domination of graphs
- Total Roman Domination Edge-Supercritical and Edge-Removal-Supercritical Graphs
- Independent Roman domination and 2-independence in trees
- Relating the outer-independent total Roman domination number with some classical parameters of graphs
- Algorithmic and complexity aspects of problems related to total Roman domination for graphs
- Title not available (Why is that?)
- Global double Roman domination in graphs
- Total Roman reinforcement in graphs
- Title not available (Why is that?)
- On the total and strong version for Roman dominating functions in graphs
- Quasi-total Roman domination in graphs
- Total Roman domination subdivision number in graphs
- Graphs with large total 2-rainbow domination number
- Roman domination in Cartesian product graphs and strong product graphs
- Algorithmic results in Roman dominating functions on graphs
- The Roman domination number of some special classes of graphs - convex polytopes
- Edge Roman domination on graphs
- Double domination in lexicographic product graphs
- Perfect double Roman domination of trees
- Domination parameters with number 2: interrelations and algorithmic consequences
- Mixed Roman domination and 2-independence in trees
- Varieties of Roman Domination
- Roman k-tuple domination number of a graph
- Closed formulas for the total Roman domination number of lexicographic product graphs
- Nordhaus-Gaddum bounds for total Roman domination
- Nearly tight approximation algorithm for (connected) Roman dominating set
- Some progress on the double Roman domination in graphs
- On the total Roman domination in trees
- Perfect Italian domination in trees
- Roman domination in graphs: the class \(\mathcal{R}_{UVR}\)
- Total Roman {2}-domination in graphs
- Total Roman domination in digraphs
- On the strong Roman domination number of graphs
- Roman \(\{k\}\)-domination in trees and complexity results for some classes of graphs
- Global total Roman domination in graphs
- Outer-independent total Roman domination in graphs
- Minimal Roman dominating functions: extensions and enumeration
- Total Italian domatic number of graphs
- Linear programming approach for various domination parameters
- The \(k\)-th Roman domination problem is polynomial on interval graphs
- Efficient algorithms for independent Roman domination on some classes of graphs
- Minimal Roman dominating functions: extensions and enumeration
- Algorithmic aspect on total Roman \(\{2\}\)-domination of Cartesian products of paths and cycles
- Title not available (Why is that?)
This page was built for publication: Roman domination on strongly chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385486)
