A note on the bounds of Roman domination numbers

DOI10.3934/math.2021234OpenAlexW3126878226MaRDI QIDQ2144876

Zepeng Li

Publication date: 17 June 2022

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

Full work available at URL: https://doi.org/10.3934/math.2021234

zbMATH Keywords

domination numberRoman dominationRoman \{2\}-domination

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Roman \(\{2 \}\)-domination
• Constructive characterizations concerning weak Roman domination in trees
• On dominating sets of maximal outerplanar and planar graphs
• Rainbow domination in graphs
• Efficient algorithms for Roman domination on some classes of graphs
• On the Roman domination number of a graph
• Roman domination in graphs.
• Extremal problems on weak Roman domination number
• Weak \(\{2\}\)-domination number of Cartesian products of cycles
• A note on domination number in maximal outerplanar graphs
• Extremal Problems for Roman Domination
• Domination in planar graphs with small diameter*
• Trees with equal Roman {2}-domination number and independent Roman {2}-domination number
• Lower bounds on the Roman and independent Roman domination numbers

This page was built for publication: A note on the bounds of Roman domination numbers