Weak Roman domination in graphs

DOI10.7151/dmgt.1532zbMath1284.05201OpenAlexW1989438579MaRDI QIDQ3171420

T. N. M. Malini Mai, P. Roushini Leely Pushpam

Publication date: 5 October 2011

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

Full work available at URL: https://semanticscholar.org/paper/ea631453e701e79acf1bc8e0439c215c356690bf

zbMATH Keywords

domination numberweak Roman domination number

Mathematics Subject Classification ID

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

Related Items (15)

Roman \(\{2 \}\)-domination ⋮ Improved integer linear programming formulation for weak Roman domination problem ⋮ Weak Roman subdivision number of graphs ⋮ Exact algorithms for weak Roman domination ⋮ Secure vertex cover of a graph ⋮ Unnamed Item ⋮ Double Roman domination number ⋮ Unnamed Item ⋮ Roman \(\{2\}\)-bondage number of a graph ⋮ Effect of vertex deletion on the weak Roman domination number of a graph ⋮ Bounds on weak Roman and 2-rainbow domination numbers ⋮ Varieties of Roman Domination ⋮ Unnamed Item ⋮ Roman domination in unicyclic graphs ⋮ An algorithm to recognize weak roman domination stable trees under vertex deletion

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