Lower and upper bounds on independent double Roman domination in trees

DOI10.5614/ejgta.2022.10.2.8zbMath1499.05473OpenAlexW4308002893MaRDI QIDQ5054041

M. Kheibari, Seyyed Mahmoud Sheikholeslami, Rana Khoeilar, Hossein Abdollahzadeh Ahangar

Publication date: 29 November 2022

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5614/ejgta.2022.10.2.8

zbMATH Keywords

double Roman dominationindependent double Roman dominating functionindependent double Roman domination number

Mathematics Subject Classification ID

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

Related Items (1)

Further results on independent double roman trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Double Roman domination
• On the Roman domination number of a graph
• Roman domination in graphs.
• Double Roman domination in trees
• Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle
• Total Roman \(\{2\}\)-dominating functions in graphs
• Maximal double Roman domination in graphs
• Independent double Roman domination in graphs
• Trees with independent Roman domination number twice the independent domination number
• Extremal Problems for Roman Domination
• Double Roman domination and domatic numbers of graphs
• A note on the independent Roman domination in unicyclic graphs
• Independent double Roman domination in graphs
• Total Roman domination for proper interval graphs
• On maximal Roman domination in graphs
• An upper bound on the double Roman domination number

This page was built for publication: Lower and upper bounds on independent double Roman domination in trees