Double Roman domination in graphs with minimum degree at least two and no C₅-cycle

DOI10.1007/S00373-021-02434-2MaRDI QIDQ2115152zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

double Roman domination numberRoman domination

Mathematics Subject Classification ID

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

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

Cites work

• 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
• scientific article; zbMATH DE number 7362655 (Why is no real title available?)
• 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

(10)

• An improved upper bound on the double Roman domination number of graphs with minimum degree at least two
• Lower and upper bounds on independent double Roman domination in trees
• An upper bound on the double Roman domination number
• An improved upper bound on the independent double Roman domination number of trees
• Disprove of a conjecture on the double Roman domination number
• Double Roman domination in graphs: algorithmic complexity
• New results on quadruple Roman domination in graphs
• Double Roman domination in some graphs
• On weak double Roman domination in graphs
• On double Roman domination problem for several graph classes

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)