On weak double Roman domination in graphs

DOI10.1016/J.DAM.2025.07.019MaRDI QIDQ6906740zbMATH OpenFDO

Authors H. Abdollahzadeh Ahangar, Mustapha Chellali, Hadi Rahbani, Seyed Mahmood Sheikholeslami, S. Soltani

Publication date 4 November 2025

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2025.07.019

zbMATH Keywords

perfect binary treesstar convex bipartite graphstreesweak double Roman domination

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Analysis of algorithms and problem complexity (68Q25)

Cites work

• Critical concept for double Roman domination in graphs
• Disprove of a conjecture on the double Roman domination number
• Double Roman domination
• Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle
• Double Roman domination in graphs: algorithmic complexity
• Quasi total double Roman domination in trees
• Restrained condition on double Roman dominating functions
• Weak double Roman domination

This page was built for publication: On weak double Roman domination in graphs

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