Roman [1,2]-domination of graphs

DOI10.1016/J.AMC.2023.128520MaRDI QIDQ6131580FDOQ6131580

Authors: Guoliang Hao, Xiaodan Chen, Seyed Mahmood Sheikholeslami, Haining Jiang 

Publication date: 18 April 2024

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Recommendations

• Roman \(\{2 \}\)-domination
• Roman \(\{2\}\)-domination problem in graphs
• Roman \(\{k\}\)-domination in trees and complexity results for some classes of graphs
• New complexity results on Roman {2}-domination
• Independent Roman \(\{2 \}\)-domination in graphs

zbMATH Keywords

NP-completeRoman domination\([12\)-domination]

Mathematics Subject Classification ID

Graph theory (05Cxx)

Cited In (3)

• On [ k ] -Roman domination in graphs
• Roman domination and independent Roman domination on graphs with maximum degree three
• Metaheuristic algorithms for solving Roman \(\{2\}\)-domination problem

This page was built for publication: Roman \([1,2]\)-domination of graphs

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