An upper bound on the double Roman domination number

DOI10.1007/s41980-020-00442-1zbMath1473.05230OpenAlexW3048662891MaRDI QIDQ5919141

Lyes Ouldrabah, Lutz Volkmann

Publication date: 15 November 2021

Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s41980-020-00442-1

zbMATH Keywords

matchingdouble Roman domination

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Double Roman domination
• Some progress on the double Roman domination in graphs
• Double Roman domination in trees
• 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
• Varieties of Roman domination II
• Paths, Trees, and Flowers

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