On the strong Roman domination number of graphs
From MaRDI portal
Publication:2403792
DOI10.1016/j.dam.2016.12.013zbMath1369.05158arXiv1502.03933OpenAlexW2963285391MaRDI QIDQ2403792
T. Mediavilla-Gradolph, M. P. Álvarez-Ruiz, J. Carlos Valenzuela-Tripodoro, Seyyed Mahmoud Sheikholeslami, Ismael González Yero
Publication date: 12 September 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.03933
Trees (05C05) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (13)
Unique response strong Roman dominating functions of graphs ⋮ On Hop Roman Domination in Trees ⋮ Unnamed Item ⋮ On the total and strong version for Roman dominating functions in graphs ⋮ On the outer independent total double Roman domination in graphs ⋮ On the \(k\)-strong Roman domination problem ⋮ Trees with equal strong Roman domination number and Roman domination number ⋮ Varieties of Roman Domination ⋮ Weakly connected Roman domination in graphs ⋮ Trees with equal Roman {2}-domination number and independent Roman {2}-domination number ⋮ Outer-independent total Roman domination in graphs ⋮ Computing strong Roman domination of trees and unicyclic graphs in linear time ⋮ On \(k\)-rainbow independent domination in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Roman domination on strongly chordal graphs
- Signed Roman domination in digraphs
- Roman domination in regular graphs
- On the Roman domination number of a graph
- Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number
- Defending the Roman Empire from multiple attacks
- Roman domination in graphs.
- Defending the Roman Empire---a new strategy
- Signed Roman domination in graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- On the Complexity of Metric Dimension
- Extremal Problems for Roman Domination
- ROMAN k-DOMINATION IN GRAPHS
- A new graph product and its spectrum
- A characterization of Roman trees
- A note on the independent Roman domination in unicyclic graphs
- Independent transversal dominating sets in graphs: Complexity and structural properties
- Protecting a graph with mobile guards
- The distance Roman domination numbers of graphs
- Signed Roman edge domination numbers in graphs
This page was built for publication: On the strong Roman domination number of graphs