Algorithmic aspects of outer-independent double Roman domination in graphs

DOI10.1142/S0129054124500059MaRDI QIDQ7032370zbMATH OpenFDO

Authors Amit Kumar Sharma, P. Venkata Subba Reddy, S. Arumugam, Jakkepalli Pavan Kumar

Publication date 5 February 2025

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

domination numberNP-completenessouter-independent double Roman dominating set

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Higher-order logic (03B16)

This page was built for publication: Algorithmic aspects of outer-independent double Roman domination in graphs

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