Recommendations
- Algorithmic aspects of Roman domination in graphs
- Perfect Roman domination in graphs
- Algorithmic and complexity aspects of problems related to total Roman domination for graphs
- Complexity of Roman \(\{ 2 \} \)-domination and the double Roman domination in graphs
- Algorithmic aspects of Roman \(\{3\}\)-domination in graphs
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2094533 (Why is no real title available?)
- scientific article; zbMATH DE number 2114685 (Why is no real title available?)
- scientific article; zbMATH DE number 2188604 (Why is no real title available?)
- A characterization of Roman trees
- A note on Roman domination in graphs
- Algorithmic graph theory and perfect graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Defending the Roman Empire from multiple attacks
- Defending the Roman Empire---a new strategy
- Domination, independent domination, and duality in strongly chordal graphs
- Efficient algorithms for Roman domination on some classes of graphs
- Extremal problems for roman domination
- Independent domination in chordal graphs
- R<scp>OMAN DOMINATION</scp>: a parameterized perspective†
- Roman domination in graphs.
- Roman domination on 2-connected graphs
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- The weighted independent domination problem is NP-complete for chordal graphs
- Upper bounds on Roman domination numbers of graphs
Cited in
(66)- Minimal Roman dominating functions: extensions and enumeration
- Algorithmic aspect on total Roman \(\{2\}\)-domination of Cartesian products of paths and cycles
- The \(k\)-th Roman domination problem is polynomial on interval graphs
- Total restrained Roman domination
- Minimal Roman dominating functions: extensions and enumeration
- Linear programming approach for various domination parameters
- Efficient algorithms for independent Roman domination on some classes of graphs
- Total Italian domatic number of graphs
- Relating the outer-independent total Roman domination number with some classical parameters of graphs
- Algorithmic results in Roman dominating functions on graphs
- Global total Roman domination in graphs
- Closed formulas for the total Roman domination number of lexicographic product graphs
- Edge Roman domination on graphs
- On the total Roman domination in trees
- Algorithmic aspects of total Roman and total double Roman domination in graphs
- Hardness results of global Roman domination in graphs
- Hardness results of global Roman domination in graphs
- Nordhaus-Gaddum bounds for total Roman domination
- Double domination in lexicographic product graphs
- Perfect double Roman domination of trees
- On the total and strong version for Roman dominating functions in graphs
- Varieties of Roman Domination
- On the strong Roman domination number of graphs
- A note on Roman domination of digraphs
- On the Roman domination stable graphs
- Computing Roman domatic number of graphs
- The Roman domination number of some special classes of graphs - convex polytopes
- Outer-independent total Roman domination in graphs
- On the differential and Roman domination number of a graph with minimum degree two
- Large hypertree width for sparse random hypergraphs
- Perfect Italian domination in trees
- Total 2-rainbow domination numbers of trees
- On the signed Roman \(k\)-domination: complexity and thin torus graphs
- Nearly tight approximation algorithm for (connected) Roman dominating set
- scientific article; zbMATH DE number 7266465 (Why is no real title available?)
- Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties
- Quasi-total Roman domination in graphs
- Some progress on the double Roman domination in graphs
- On the total Roman domination stability in graphs
- Global double Roman domination in graphs
- Total Roman domination edge-supercritical and edge-removal-supercritical graphs
- Total Roman domatic number of a graph
- A Nordhaus-Gaddum bound for Roman domination
- Total Roman domination on the digraphs
- Domination parameters with number 2: interrelations and algorithmic consequences
- Algorithmic and complexity aspects of problems related to total Roman domination for graphs
- Total Roman domination for proper interval graphs
- Quasi-total Roman bondage number in graphs
- Total Roman domination in digraphs
- Total Roman reinforcement in graphs
- Roman \(k\)-tuple domination in graphs
- Roman \(\{k\}\)-domination in trees and complexity results for some classes of graphs
- The Roman domatic problem in graphs and digraphs: a survey
- On two open problems concerning weak Roman domination in trees
- Roman domination in graphs: the class \(\mathcal{R}_{UVR}\)
- Roman domination in graphs
- Independent Roman domination and 2-independence in trees
- Total Roman domination subdivision number in graphs
- Roman \(k\)-domination: hardness, approximation and parameterized results
- Graphs with large total 2-rainbow domination number
- Roman domination in Cartesian product graphs and strong product graphs
- Algorithm and hardness results in double Roman domination of graphs
- Quasi-total Roman reinforcement in graphs
- Mixed Roman domination and 2-independence in trees
- Total Roman domination in the lexicographic product of graphs
- Total Roman \(\{2\}\)-domination in graphs
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)
