Outer-independent total Roman domination in graphs
DOI10.1016/J.DAM.2018.12.018zbMath1426.05126OpenAlexW2908984162MaRDI QIDQ2328098
Dorota Kuziak, Abel Cabrera Martínez, Ismael González 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
vertex covertotal dominationRoman dominationtotal Roman dominationouter-independent total Roman dominationvertex independence
Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)
Related Items (10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Roman domination on strongly chordal 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
- Roman domination in graphs.
- Mixed Roman domination in graphs
- On the strong Roman domination number of graphs
- On trees attaining an upper bound on the total domination number
- Signed Roman domination in graphs
- Outer independent Roman dominating functions in graphs
- ROMAN k-DOMINATION IN GRAPHS
- A characterization of Roman trees
- A note on the independent Roman domination in unicyclic graphs
- Total Domination in Graphs
- Total Roman domination in graphs
- The distance Roman domination numbers of graphs
- On maximal Roman domination in graphs
This page was built for publication: Outer-independent total Roman domination in graphs