Edge-cost double Roman domination

DOI10.1007/S10100-026-01014-0MaRDI QIDQ7404504zbMATH OpenFDO

Authors Noémie Catherinot, Ana Klobučar Barišić

Publication date 2026

Published in CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10100-026-01014-0

zbMATH Keywords

algorithmsdouble Roman dominationedge-cost double Roman dominationNP-hardnesstree graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Operations research and management science (90Bxx) Combinatorial optimization (90C27)

Cites work

• \(k\)-tuple and \(k\)-tuple total dominations on web graphs
• Algorithmic results on double Roman domination in graphs
• An upper bound on the double Roman domination number
• Complexity of Roman \(\{ 2 \} \)-domination and the double Roman domination in graphs
• Double Roman domination
• Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle
• Double Roman domination in some graphs
• Double Roman domination in trees
• On the double Roman domination in graphs
• Properties of double Roman domination on cardinal products of graphs
• Solving the minimum-cost double Roman domination problem

This page was built for publication: Edge-cost double Roman domination

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