Locating Roman domination in graphs
From MaRDI portal
Publication:5206590
zbMATH Open1427.05168MaRDI QIDQ5206590FDOQ5206590
Authors: Nader Jafari Rad, Hadi Rahbani, Lutz Volkmann
Publication date: 18 December 2019
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cited In (5)
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)