Extremal graphs for a bound on the Roman domination number

DOI10.7151/DMGT.2142zbMath1439.05175OpenAlexW2883320500WikidataQ129514144 ScholiaQ129514144MaRDI QIDQ2175235

Ahmed Bouchou, Mostafa Blidia, Mustapha Chellali

Publication date: 28 April 2020

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2142

zbMATH Keywords

Roman dominationNordhaus-Gaddum inequalitiesRoman domination number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Roman Domination in Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Roman domination in graphs.
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• The differential and the roman domination number of a graph
• Domination in graphs with minimum degree two
• Extremal Problems for Roman Domination

This page was built for publication: Extremal graphs for a bound on the Roman domination number