Mixed double Roman domination in graphs

DOI10.22049/CCO.2024.28947.1789MaRDI QIDQ7323546zbMATH OpenFDO

Authors Ahangar Hossein Abdollahzadeh, Mustapha Chellali, Seyed Mahmood Sheikholeslami, J. Carlos Valenzuela-Tripodoro

Publication date 1 September 2026

Published in Communications in Combinatorics and Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution-ShareAlike 4.0 International

Full work available at URL https://doi.org/10.22049/CCO.2024.28947.1789

Mathematics Subject Classification ID

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

Cites work

• A note on the double Roman domination number of graphs.
• An improved upper bound on the double Roman domination number of graphs with minimum degree at least two
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• Double Roman domination
• Efficient algorithms for Roman domination on some classes of graphs
• Linear time solvable optimization problems on graphs of bounded clique-width
• Mixed Roman domination and 2-independence in trees
• Mixed Roman domination in graphs
• On the strong Roman domination number of graphs
• Roman domination in graphs
• Roman domination in graphs.
• Total roman domination in graphs
• Varieties of Roman Domination
• Varieties of Roman domination. II

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

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