Disprove of a conjecture on the double Roman domination number
From MaRDI portal
Publication:6122419
DOI10.1007/S00010-023-01029-XMaRDI QIDQ6122419
Seyyed Mahmoud Sheikholeslami, Rana Khoeilar, Mustapha Chellali, Hossein Karami, Zehui Shao
Publication date: 1 March 2024
Published in: Aequationes Mathematicae (Search for Journal in Brave)
Cites Work
- Double Roman domination
- Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle
- Roman domination and double Roman domination numbers of Sierpiński graphs \(S(K_n,t)\)
- 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
- A note on the double Roman domination number of graphs
- Varieties of Roman Domination
- Roman Domination in Graphs
- Varieties of Roman domination II
- An upper bound on the double Roman domination number
This page was built for publication: Disprove of a conjecture on the double Roman domination number