Total Roman \(\{2\}\)-dominating functions in graphs
From MaRDI portal
Publication:2151223
DOI10.7151/dmgt.2316zbMath1492.05109OpenAlexW3020124305MaRDI QIDQ2151223
Mustapha Chellali, Hossein Abdollahzadeh Ahangar, Seyyed Mahmoud Sheikholeslami, J. Carlos Valenzuela-Tripodoro
Publication date: 1 July 2022
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2316
Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (13)
Lower and upper bounds on independent double Roman domination in trees ⋮ From Italian domination in lexicographic product graphs to w-domination in graphs ⋮ Triple Roman domination in graphs ⋮ On the outer independent total double Roman domination in graphs ⋮ Total Italian domatic number of graphs ⋮ Further results on independent double roman trees ⋮ From \(w\)-domination in graphs to domination parameters in lexicographic product graphs ⋮ Restrained Italian bondage number in graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Algorithmic aspects of total Roman ${2}$-domination in graphs ⋮ Total k-rainbow reinforcement number in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Roman \(\{2 \}\)-domination
- Efficient algorithms for Roman domination on some classes of graphs
- Roman domination in graphs.
- Linear time solvable optimization problems on graphs of bounded clique-width
- Roman \(\{2\}\)-domination problem in graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Graph-theoretic parameters concerning domination, independence, and irredundance
This page was built for publication: Total Roman \(\{2\}\)-dominating functions in graphs