Outer-independent signed Roman domination function in graphs

DOI10.1007/S43069-026-00619-0MaRDI QIDQ6842977zbMATH OpenFDO

Authors Peng Li, Jianhui Shang, Ning Li

Publication date 17 March 2026

Published in SN Operations Research Forum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S43069-026-00619-0

zbMATH Keywords

outer-independent signed Roman dominationouter-independent signed Roman domination functionRoman domination functionsigned Roman domination function

Mathematics Subject Classification ID

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

Cites work

• Algorithmic aspects of outer independent Roman domination in graphs
• Algorithmic aspects of Roman domination in graphs
• Dominating sets for split and bipartite graphs
• Efficient algorithms for independent Roman domination on some classes of graphs
• Efficient algorithms for Roman domination on some classes of graphs
• Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 825134 (Why is no real title available?)
• Outer independent Roman dominating functions in graphs
• Roman domination in graphs.
• Signed Roman domination in graphs
• The algorithmic use of hypertree structure and maximum neighbourhood orderings
• The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs

This page was built for publication: Outer-independent signed Roman domination function in graphs

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