Algorithmic aspects of outer independent Roman domination in graphs
From MaRDI portal
Publication:5101892
DOI10.1142/S1793830922500045zbMATH Open1493.05237OpenAlexW3195598330MaRDI QIDQ5101892FDOQ5101892
Authors:
Publication date: 2 September 2022
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830922500045
Recommendations
- Algorithmic complexity of outer independent Roman domination and outer independent total Roman domination
- Algorithmic Aspects of Outer-Independent Total Roman Domination in Graphs
- Outer independent Roman dominating functions in graphs
- Outer-independent total Roman domination in graphs
- Outer independent double Roman domination
Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- 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
- Threshold graphs and related topics
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- On the Roman domination number of a graph
- Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs
- Algorithmic aspects of \(b\)-disjunctive domination in graphs
- Roman domination perfect graphs
- Algorithmic aspects of Roman domination in graphs
- Outer-independent total Roman domination in graphs
- Algorithmic aspects of secure connected domination in graphs
- Outer independent Roman dominating functions in graphs
- Algorithmic aspects of 2-secure domination in graphs
Cited In (8)
- Algorithmic Aspects of Outer-Independent Total Roman Domination in Graphs
- New results on quadruple Roman domination in graphs
- Algorithmic complexity of outer independent Roman domination and outer independent total Roman domination
- Relating the outer-independent total Roman domination number with some classical parameters of graphs
- Outer independent Roman dominating functions in graphs
- Efficient algorithms for independent Roman domination on some classes of graphs
- New bounds on the outer-independent total double Roman domination number
- Outer-independent total Roman domination in graphs
This page was built for publication: Algorithmic aspects of outer independent Roman domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5101892)
