Signed Roman domination in graphs
From MaRDI portal
Publication:2444148
DOI10.1007/s10878-012-9500-0zbMath1319.90070OpenAlexW2140596247MaRDI QIDQ2444148
Michael A. Henning, V. Samodivkin, Christian Löwenstein, Yan-Cai Zhao, Hossein Abdollahzadeh Ahangar
Publication date: 8 April 2014
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9500-0
Related Items (54)
Bounds on signed total double Roman domination ⋮ Computing Roman domatic number of graphs ⋮ Improved integer linear programming formulation for weak Roman domination problem ⋮ Signed Roman \(k\)-domination in digraphs ⋮ Bounds on the signed Roman \(k\)-domination number of a digraph ⋮ Unnamed Item ⋮ On the signed total Roman domination and domatic numbers of graphs ⋮ On trees with equal Roman domination and outer-independent Roman domination numbers ⋮ Signed total Roman domination in graphs ⋮ The Roman domatic problem in graphs and digraphs: a survey ⋮ Signed mixed Roman domination numbers in graphs ⋮ Unnamed Item ⋮ Edge Roman domination on graphs ⋮ Perfect Italian domination in graphs: complexity and algorithms ⋮ The signed edge-domatic number of nearly cubic graphs ⋮ On the strong Roman domination number of graphs ⋮ Perfect Italian domination in cographs ⋮ On the signed Roman \(k\)-domination: complexity and thin torus graphs ⋮ Total Roman domination in the lexicographic product of graphs ⋮ Unique response Roman domination: complexity and algorithms ⋮ Bounds on the locating Roman domination number in trees ⋮ Weak signed Roman k-domination in digraphs ⋮ On the \(k\)-strong Roman domination problem ⋮ Bounds on the domination number of a digraph ⋮ On \(d\)-stable locally checkable problems parameterized by mim-width ⋮ On the signed Roman k-domination in graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The signed Roman \(k\)-domatic number of a graph ⋮ Signed double Roman domination in graphs ⋮ A characterization of double Roman trees ⋮ Signed Roman domination in digraphs ⋮ Signed Roman edge \(k\)-domination in graphs ⋮ Double Roman domination number ⋮ Double Roman domination in digraphs ⋮ Signed Roman edge domination numbers in graphs ⋮ Varieties of Roman domination II ⋮ Signed Roman \(k\)-domination in graphs ⋮ Algorithmic results on double Roman domination in graphs ⋮ The signed Roman domination number of two classes graphs ⋮ On the signed strong Roman domination number of graphs ⋮ Signed total double Roman k-domination in graphs ⋮ Roman domination excellent graphs: trees ⋮ Bounds for signed double Roman k-domination in trees ⋮ Outer-independent total Roman domination in graphs ⋮ Unnamed Item ⋮ On perfect Roman domination number in trees: complexity and bounds ⋮ Perfect Roman domination in graphs ⋮ The signed Roman domatic number of a digraph ⋮ Signed Roman \(k\)-domination in trees ⋮ Majority Roman domination in graphs ⋮ SIGNED ROMAN DOMINATION NUMBER AND JOIN OF GRAPHS ⋮ Weak signed Roman domination in graphs ⋮ Weak Signed Roman Domination in Digraphs
Cites Work
- A note on the lower bounds of signed domination number of a graph
- Signed domination in regular graphs and set-systems
- Defending the Roman Empire from multiple attacks
- Roman domination in graphs.
- Defending the Roman Empire---a new strategy
- Signed domination in regular graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Extremal Problems for Roman Domination
- 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: Signed Roman domination in graphs
