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

• An improved upper bound on the double Roman domination number of graphs with minimum degree at least two
• An upper bound on the double Roman domination number
• scientific article; zbMATH DE number 7478539
• A note on the double Roman domination number of graphs.
• On the double Roman domination of graphs

zbMATH Keywords

Roman dominationdouble Roman domination number

Mathematics Subject Classification ID

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

• Title not available (Why is that?)
• An improved upper bound on the double Roman domination number of graphs with minimum degree at least two
• An upper bound on the double Roman domination number
• Double Roman domination
• Double Roman domination and domatic numbers of graphs
• Maximal double Roman domination in graphs
• On the double Roman domination in graphs
• Outer independent double Roman domination
• Roman domination in graphs
• Some progress on the double Roman domination in graphs
• Total double Roman domination in graphs
• Triple Roman domination in graphs
• Varieties of Roman Domination
• Varieties of Roman domination. II

Cited In (7)

• An improved upper bound on the double Roman domination number of graphs with minimum degree at least two
• New results on quadruple Roman domination in graphs
• Double Roman domination in graphs: algorithmic complexity
• 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

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)