Roman domination on strongly chordal graphs
From MaRDI portal
Publication:385486
DOI10.1007/s10878-012-9482-yzbMath1282.90217OpenAlexW2028333952MaRDI QIDQ385486
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
Related Items (61)
Computing Roman domatic number of graphs ⋮ Algorithmic aspects of total Roman and total double Roman domination in graphs ⋮ Hardness results of global Roman domination in graphs ⋮ Unnamed Item ⋮ A note on Roman domination of digraphs ⋮ Some progress on the double Roman domination in graphs ⋮ Relating the outer-independent total Roman domination number with some classical parameters of graphs ⋮ The Roman domatic problem in graphs and digraphs: a survey ⋮ Edge Roman domination on graphs ⋮ Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties ⋮ On the strong Roman domination number of graphs ⋮ On the total and strong version for Roman dominating functions in graphs ⋮ Independent Roman domination and 2-independence in trees ⋮ On the Roman domination stable graphs ⋮ On the differential and Roman domination number of a graph with minimum degree two ⋮ On the signed Roman \(k\)-domination: complexity and thin torus graphs ⋮ Domination parameters with number 2: interrelations and algorithmic consequences ⋮ Minimal Roman dominating functions: extensions and enumeration ⋮ Total Roman domination on the digraphs ⋮ Total Roman domination in the lexicographic product of graphs ⋮ Total Italian domatic number of graphs ⋮ Roman \(k\)-domination: hardness, approximation and parameterized results ⋮ Quasi-total Roman bondage number in graphs ⋮ Quasi-total Roman reinforcement in graphs ⋮ Algorithmic results in Roman dominating functions on graphs ⋮ Nordhaus-Gaddum bounds for total Roman domination ⋮ Global total Roman domination in graphs ⋮ Unnamed Item ⋮ On the total Roman domination in trees ⋮ Total 2-rainbow domination numbers of trees ⋮ Hardness results of global Roman domination in graphs ⋮ Perfect Italian domination in trees ⋮ Efficient algorithms for independent Roman domination on some classes of graphs ⋮ Mixed Roman domination and 2-independence in trees ⋮ Quasi-total Roman domination in graphs ⋮ Graphs with large total 2-rainbow domination number ⋮ Total Roman domination for proper interval graphs ⋮ Roman \(\{k\}\)-domination in trees and complexity results for some classes of graphs ⋮ Total Roman Domination Edge-Supercritical and Edge-Removal-Supercritical Graphs ⋮ Varieties of Roman Domination ⋮ Roman Domination in Graphs ⋮ Roman domination in graphs: The class ℛUV R ⋮ Closed formulas for the total Roman domination number of lexicographic product graphs ⋮ Algorithmic and complexity aspects of problems related to total Roman domination for graphs ⋮ The Roman domination number of some special classes of graphs - convex polytopes ⋮ Total Roman reinforcement in graphs ⋮ Total Roman domatic number of a graph ⋮ Total Roman domination in digraphs ⋮ Total Roman {2}-domination in graphs ⋮ Roman k-tuple domination number of a graph ⋮ Perfect double Roman domination of trees ⋮ Double domination in lexicographic product graphs ⋮ A Nordhaus–Gaddum bound for Roman domination ⋮ Nearly tight approximation algorithm for (connected) Roman dominating set ⋮ Outer-independent total Roman domination in graphs ⋮ Linear programming approach for various domination parameters ⋮ On the total Roman domination stability in graphs ⋮ Large hypertree width for sparse random hypergraphs ⋮ Total Roman domination subdivision number in graphs ⋮ Global double Roman domination in graphs ⋮ Algorithm and hardness results in double Roman domination of graphs
Cites Work
- Upper bounds on Roman domination numbers of graphs
- Domination, independent domination, and duality in strongly chordal graphs
- A note on Roman domination in graphs
- Efficient algorithms for Roman domination on some classes of graphs
- Independent domination in chordal graphs
- Defending the Roman Empire from multiple attacks
- Roman domination in graphs.
- Defending the Roman Empire---a new strategy
- Algorithmic graph theory and perfect graphs
- The weighted independent domination problem is NP-complete for chordal graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Roman Domination on 2-Connected Graphs
- Extremal Problems for Roman Domination
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- A characterization of Roman trees
- R<scp>OMAN DOMINATION</scp>: a parameterized perspective†
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Roman domination on strongly chordal graphs
