Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle

DOI10.1007/S00373-021-02434-2zbMath1484.05158OpenAlexW4210440361MaRDI QIDQ2115152

Mustapha Chellali, Saeed Kosari, Zehui Shao, Hossein Karami, Rana Khoeilar, Seyyed Mahmoud Sheikholeslami

Publication date: 15 March 2022

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

Full work available at URL: https://doi.org/10.1007/s00373-021-02434-2

zbMATH Keywords

Roman dominationdouble Roman domination number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

Related Items (5)

Lower and upper bounds on independent double Roman domination in trees ⋮ An improved upper bound on the independent double Roman domination number of trees ⋮ Disprove of a conjecture on the double Roman domination number ⋮ New results on quadruple Roman domination in graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Double Roman domination
• Some progress on the double Roman domination in graphs
• Maximal double Roman domination in graphs
• Outer independent double Roman domination
• 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
• Triple Roman domination in graphs
• Varieties of Roman Domination
• Roman Domination in Graphs
• Double Roman domination and domatic numbers of graphs
• Varieties of Roman domination II
• Total double Roman domination in graphs
• An upper bound on the double Roman domination number

This page was built for publication: Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle