Restrained double Roman domination of a graph

DOI10.1051/RO/2022089zbMath1497.05210arXiv2106.08501OpenAlexW3167774038MaRDI QIDQ5104603

Doost Ali Mojdeh, Iman Masoumi, Lutz Volkmann

Publication date: 15 September 2022

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.08501

zbMATH Keywords

dominationrestrained Roman dominationrestrained double Roman domination

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)

Related Items (6)

The restrained double Roman domination in graphs ⋮ 2-power domination number for Knödel graphs and its application in communication networks ⋮ On the total restrained double Italian domination ⋮ Domination parameters of generalized Sierpiński graphs ⋮ An extension of locating-total domination problem and its complexity ⋮ Restrained condition on double Roman dominating functions

This page was built for publication: Restrained double Roman domination of a graph