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

DOI10.1080/09728600.2022.2094735zbMATH Open1511.05186MaRDI QIDQ6101465FDOQ6101465

Authors: F. Nahani Pour, H. Abdollahzadeh Ahangar, Mustapha Chellali, Seyed Mahmood Sheikholeslami 

Publication date: 1 June 2023

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

Recommendations

• Lower and upper bounds on independent double Roman domination in trees
• An upper bound for the double outer-independent domination number of a tree
• On the double Roman domination number in trees
• scientific article; zbMATH DE number 7478539
• An upper bound on the double domination number of trees
• Relating total double Roman domination to 2-independence in trees
• An improved upper bound on the double Roman domination number of graphs with minimum degree at least two
• Further results on independent double roman trees
• A lower bound on the double outer-independent domination number of a tree
• An upper bound on the double Roman domination number

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

• Double Roman domination
• Double Roman domination in trees
• 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
• An upper bound on the double Roman domination number
• Outer independent double Roman domination
• Total double Roman domination in graphs
• On the independent double Roman domination in graphs
• Independent double Roman domination in graphs
• Independent double Roman domination in graphs
• Double Roman 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
• Maximal double Roman domination in graphs
• Title not available (Why is that?)

Cited In (4)

• On the double Roman domination number in trees
• Lower and upper bounds on independent double Roman domination in trees
• On the independent double Roman domination in graphs
• Independent double Roman domination in graphs

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

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