Double Roman domination in graphs with minimum degree at least two and no C₅-cycle
DOI10.1007/S00373-021-02434-2zbMATH Open1484.05158OpenAlexW4210440361MaRDI QIDQ2115152FDOQ2115152
Authors: Saeed Kosari, Zehui Shao, Mustapha Chellali, Seyed Mahmood Sheikholeslami, R. Khoeilar, Hossein Karami 
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
Recommendations
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07) Structural characterization of families of graphs (05C75)
Cites Work
- Roman Domination in Graphs
- Double Roman domination
- Some progress on the 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
- An upper bound on the double Roman domination number
- Varieties of Roman domination II
- Title not available (Why is that?)
- Outer independent double Roman domination
- Triple Roman domination in graphs
- Total double Roman domination in graphs
- Varieties of Roman Domination
- Maximal double Roman domination in graphs
Cited In (6)
- New results on quadruple Roman domination in graphs
- An upper bound on the double Roman domination number
- Lower and upper bounds on independent double Roman domination in trees
- Disprove of a conjecture on the double Roman domination number
- An improved upper bound on the independent double Roman domination number of trees
- Title not available (Why is that?)
This page was built for publication: Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115152)
