An improved upper bound on the independent double Roman domination number of trees

DOI10.1080/09728600.2022.2094735zbMath1511.05186MaRDI QIDQ6101465

Hossein Abdollahzadeh Ahangar, F. Nahani Pour, Mustapha Chellali, Seyyed Mahmoud Sheikholeslami

Publication date: 1 June 2023

Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

treesindependent double Roman domination

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Double Roman domination
• Double Roman domination in trees
• A note on connected bipartite graphs having independent domination number half their order.
• Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle
• On the independent double Roman domination in graphs
• Maximal double Roman domination in graphs
• Outer independent double Roman domination
• Independent double Roman domination in graphs
• An improved upper bound on the double Roman domination number of graphs with minimum degree at least two
• On the double Roman domination in graphs
• Double Roman domination and domatic numbers of graphs
• Independent double Roman domination in graphs
• Total double Roman domination in graphs
• An upper bound on the double Roman domination number

This page was built for publication: An improved upper bound on the independent double Roman domination number of trees