Total Roman \(\{2\}\)-reinforcement of graphs

DOI10.1155/2021/5515250zbMath1477.05136OpenAlexW3152577304MaRDI QIDQ2035667

M. Kheibari, Hossein Abdollahzadeh Ahangar, Seyyed Mahmoud Sheikholeslami, Rana Khoeilar

Publication date: 25 June 2021

Published in: Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2021/5515250

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Trees with total Roman domination number equal to Roman domination number plus its domination number: complexity and structural properties

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Roman \(\{2 \}\)-domination
• Italian domination in trees
• Independent Roman \(\{2 \}\)-domination in graphs
• Perfect Italian domination in trees
• Graphs with large Italian domination number
• Outer independent double Roman domination
• Total Roman reinforcement in graphs
• Total reinforcement number of a graph
• Triple Roman domination in graphs
• Varieties of Roman Domination
• Total domination in graphs
• Varieties of Roman domination II

This page was built for publication: Total Roman \(\{2\}\)-reinforcement of graphs