An improved upper bound on the double Roman domination number of graphs with minimum degree at least two
From MaRDI portal
Publication:2334052
DOI10.1016/j.dam.2019.06.018zbMath1426.05131OpenAlexW2958098820WikidataQ127529762 ScholiaQ127529762MaRDI QIDQ2334052
Mustapha Chellali, Rana Khoeilar, Hossein Karami, Seyyed Mahmoud Sheikholeslami
Publication date: 6 November 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2019.06.018
Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (17)
Unnamed Item ⋮ Double Roman domination in generalized Petersen graphs ⋮ Triple Roman domination in graphs ⋮ Total double Roman domination numbers in digraphs ⋮ An improved upper bound on the independent double Roman domination number of trees ⋮ Disprove of a conjecture on the double Roman domination number ⋮ On [ k -Roman domination in graphs] ⋮ New results on quadruple Roman domination in graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An upper bound on the double Roman domination number ⋮ Varieties of Roman Domination ⋮ Perfect double Roman domination of trees ⋮ Double Roman reinforcement number in graphs ⋮ Quadruple Roman domination in graphs ⋮ Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle ⋮ Double Roman domination subdivision number in graphs
Cites Work
This page was built for publication: An improved upper bound on the double Roman domination number of graphs with minimum degree at least two
