Locating Roman domination in graphs

MaRDI QIDQ5206590zbMATH OpenFDO

Authors Nader Jafari Rad, Hadi Rahbani, Lutz Volkmann

Publication date 18 December 2019

zbMATH Keywords

Roman domination numberlocating domination number

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Bounds on the locating Roman domination number in trees
• Roman domination in graphs.
• A characterization of Roman trees
• On the Roman bondage number of a graph
• On the Roman domination subdivision number of a graph

Cited in

(5)

• Bounds on the locating Roman domination number in trees
• Isolate Roman domination in graphs
• Resolving Roman domination in graphs
• Algorithmic aspects of Roman graphs
• Varieties of Roman domination. II

This page was built for publication: Locating Roman domination in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5206590)