Relating the outer-independent total Roman domination number with some classical parameters of graphs
From MaRDI portal
Publication:2141037
DOI10.1007/S00009-022-02061-YzbMath1497.05200arXiv2112.05476OpenAlexW4280599565MaRDI QIDQ2141037
Dorota Kuziak, Ismael González Yero, Abel Cabrera Martínez
Publication date: 23 May 2022
Published in: Mediterranean Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.05476
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Roman domination on strongly chordal graphs
- A survey and classification of Sierpiński-type graphs
- Roman domination in graphs.
- Outer-independent total Roman domination in graphs
- On three outer-independent domination related parameters in graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Outer independent Roman dominating functions in graphs
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
- 1-perfect codes in Sierpiński graphs
- Total Domination in Graphs
- The total co-independent domination number of some graph operations
- Total Roman domination in graphs
This page was built for publication: Relating the outer-independent total Roman domination number with some classical parameters of graphs