Outer-independent total Roman domination in graphs
DOI10.1016/J.DAM.2018.12.018zbMATH Open1426.05126OpenAlexW2908984162MaRDI QIDQ2328098FDOQ2328098
Authors: Dorota Kuziak, Abel Cabrera Martínez, Ismael G. Yero 
Publication date: 9 October 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.12.018
Recommendations
- Outer independent Roman dominating functions in graphs
- On the outer independent total double Roman domination in graphs
- Algorithmic Aspects of Outer-Independent Total Roman Domination in Graphs
- Algorithmic aspects of outer independent Roman domination in graphs
- Relating the outer-independent total Roman domination number with some classical parameters of graphs
- On total Roman domination in graphs
- Total roman domination in graphs
- Independent Roman \(\{2 \}\)-domination in graphs
- Further results on the independent Roman domination number of graphs
- Independent double Roman domination in graphs
Roman dominationtotal dominationvertex covertotal Roman dominationouter-independent total Roman dominationvertex independence
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On trees attaining an upper bound on the total domination number
- Roman domination in graphs.
- Total domination in graphs
- A survey of selected recent results on total domination in graphs
- Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number
- Signed Roman domination in graphs
- Roman domination on strongly chordal graphs
- A characterization of Roman trees
- Roman \(k\)-domination in graphs
- Total roman domination in graphs
- The distance Roman domination numbers of graphs
- On maximal Roman domination in graphs
- Edge roman domination in graphs
- Title not available (Why is that?)
- Properties of independent Roman domination in graphs
- Mixed Roman domination in graphs
- A note on the independent Roman domination in unicyclic graphs
- Outer independent Roman dominating functions in graphs
- On the strong Roman domination number of graphs
Cited In (15)
- On the outer independent total double Roman domination in graphs
- Algorithmic Aspects of Outer-Independent Total Roman Domination in Graphs
- Algorithmic complexity of outer independent Roman domination and outer independent total Roman domination
- Roman domination stability in graphs
- Relating the outer-independent total Roman domination number with some classical parameters of graphs
- On the total version of the covering Italian domination problem
- Outer independent Roman dominating functions in graphs
- Outer independent double Italian domination: Complexity, characterization
- Title not available (Why is that?)
- Independent Roman \(\{2 \}\)-domination in graphs
- Outer-independent Roman domination on Cartesian product of paths
- Algorithmic aspects of outer independent Roman domination in graphs
- The total co-independent domination number of some graph operations
- On the outer independent double Roman domination number
- Varieties of Roman domination. II
This page was built for publication: Outer-independent total Roman domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2328098)
