Maximal double Roman domination in graphs

DOI10.1016/J.AMC.2021.126662MaRDI QIDQ2247105zbMATH OpenOpenAlexFDO

Authors Mustapha Chellali, H. Abdollahzadeh Ahangar, Seyed Mahmood Sheikholeslami, J. Carlos Valenzuela-Tripodoro

Publication date 16 November 2021

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2021.126662

zbMATH Keywords

double Roman dominationmaximal double Roman dominationmaximal Roman domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• On maximal Roman domination in graphs
• On the double Roman domination in graphs
• Some progress on the double Roman domination in graphs
• On algorithmic complexity of double Roman domination
• Double Roman trees.

Cites work

• Double Roman domination
• Efficient algorithms for Roman domination on some classes of graphs
• scientific article; zbMATH DE number 6769213 (Why is no real title available?)
• Linear time solvable optimization problems on graphs of bounded clique-width
• On algorithmic complexity of double Roman domination
• On maximal Roman domination in graphs
• On the double Roman domination in graphs
• Outer independent double Roman domination
• Roman domination in graphs
• Roman domination in graphs.
• Triple Roman domination in graphs
• Varieties of Roman domination. II

Cited in

(17)

• Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle
• A new approach on locally checkable problems
• Lower and upper bounds on independent double Roman domination in trees
• scientific article; zbMATH DE number 6769213 (Why is no real title available?)
• On maximal Roman domination in graphs
• On the outer independent total double Roman domination in graphs
• Total Roman domination on the digraphs
• scientific article; zbMATH DE number 7693187 (Why is no real title available?)
• An improved upper bound on the independent double Roman domination number of trees
• Further results on independent double roman trees
• Double Roman domination in graphs: algorithmic complexity
• On [ k ] -Roman domination in graphs
• New results on quadruple Roman domination in graphs
• On maximal Roman domination in graphs: complexity and algorithms
• The k-th Roman domination problem is polynomial on interval graphs
• Lower bounds on signed total double Roman k-domination in graphs
• Algorithmic aspects of outer-independent double Roman domination in graphs

This page was built for publication: Maximal double Roman domination in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2247105)