Roman [1,2]-domination of graphs

DOI10.1016/J.AMC.2023.128520MaRDI QIDQ6131580zbMATH OpenFDO

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)

Full work available at URL https://doi.org/10.1016/J.AMC.2023.128520

zbMATH Keywords

2\)-domination]\([1NP-completeRoman domination

Mathematics Subject Classification ID

Graph theory (05Cxx)

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

Cited in

(3)

• Roman domination and independent Roman domination on graphs with maximum degree three
• On [ k ] -Roman domination in graphs
• 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)