The characterizations and complexity of Roman \{2\}-domination number and 2-domination number in graphs

DOI10.1007/S10878-026-01441-4MaRDI QIDQ7314353zbMATH OpenFDO

Authors Cai-Xia Wang, Yu Yang, Zepeng Li, S. J. Xu

Publication date 14 August 2026

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10878-026-01441-4

Mathematics Subject Classification ID

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

Cites work

• A characterization of Roman trees
• Independent perfect dominating sets in semi-Cayley graphs
• Italian domination in trees
• Rainbow domination and related problems on strongly chordal graphs
• Rainbow domination in graphs
• Roman \(\{2 \}\)-domination
• Roman \(\{k\}\)-domination in trees and complexity results for some classes of graphs
• Roman domination in graphs.
• The complexity of total edge domination and some related results on trees
• Weak \(\{2\}\)-domination number of Cartesian products of cycles

This page was built for publication: The characterizations and complexity of Roman \{2\}-domination number and 2-domination number in graphs

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