Varieties of Roman domination. II
From MaRDI portal
Publication:4956207
DOI10.1016/J.AKCEJ.2019.12.001zbMATH Open1468.05202OpenAlexW4214937823MaRDI QIDQ4956207FDOQ4956207
Authors: Mustapha Chellali, Nader Jafari Rad, Lutz Volkmann, Seyed Mahmood Sheikholeslami 
Publication date: 1 September 2021
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.akcej.2019.12.001
Recommendations
Cites Work
- Title not available (Why is that?)
- Roman domination in graphs.
- On the corona of two graphs
- Roman \(\{2 \}\)-domination
- Unique response Roman domination in graphs
- Signed Roman domination in graphs
- Trees with strong equality between the roman domination number and the unique response Roman domination number
- Title not available (Why is that?)
- Title not available (Why is that?)
- Signed Roman edge domination numbers in graphs
- Signed Roman \(k\)-domination in graphs
- On the signed total Roman domination and domatic numbers of graphs
- Signed total Roman domination in graphs
- Domination and location in acyclic graphs
- Signed mixed Roman domination numbers in graphs
- Title not available (Why is that?)
- The distance Roman domination numbers of graphs
- Double Roman domination
- Title not available (Why is that?)
- On maximal Roman domination in graphs
- Global Roman domination in trees
- Signed total Roman \(k\)-domination in graphs
- On the signed Roman k-domination in graphs
- Signed Roman \(k\)-domination in trees
- Signed total Roman edge domination in graphs
- On the double Roman domination in graphs
- Signed double Roman domination in graphs
- Outer independent double Roman domination
- Global Roman domination in graphs
- Roman dominating influence parameters
- Properties of independent Roman domination in graphs
- Mixed Roman domination in graphs
- Bounds on the locating Roman domination number in trees
- On the independent double Roman domination in graphs
- Independent double Roman domination in graphs
- Outer-independent total Roman domination in graphs
- Distance Roman domination in random graphs
- Outer independent Roman dominating functions in graphs
- Signed total double Roman \(k\)-domination in graphs
- The unique response Roman domination in trees
- Mixed Roman domination and 2-independence in trees
- Signed double roman domination of graphs
- Roman \(\{ 3 \}\)-domination (double Italian domination)
- Graphs with large hop Roman domination number
- A constructive characterization of vertex cover Roman trees
- Outer independent Roman domination number of trees
- On trees with equal Roman domination and outer-independent Roman domination numbers
- Weak signed Roman domination in graphs
- On hop Roman domination in trees
- Nonnegative signed total Roman domination in graphs
- Signed strong Roman domination in graphs
- Some progress on the mixed roman domination in graphs
- Nonnegative signed Roman domination in graphs
- Connected graphs with maximal Roman domination number one less than their order.
- Locating Roman domination in graphs
Cited In (64)
- Double Roman reinforcement number in graphs
- Double Roman domination subdivision number in graphs
- The Roman domatic problem in graphs and digraphs: a survey
- Remarks on the outer-independent double Italian domination number
- On the outer-independent double Italian domination number
- On the outer independent total double Roman domination in graphs
- Title not available (Why is that?)
- Bounds on the outer-independent Roman domination number of unicyclic and bicyclic graphs
- On [ k ] -Roman domination in graphs
- Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle
- New results on quadruple Roman domination in graphs
- On algorithmic complexity of double Roman domination
- Maximal double Roman domination in graphs
- On the total Roman domination stability in graphs
- Quadruple Roman domination in graphs
- An upper bound on the double Roman domination number
- Quasi-total Roman reinforcement in graphs
- Graphs whose weak Roman domination number increases by the deletion of any edge
- Complexity of signed total \(k\)-Roman domination problem in graphs
- Properties of double Roman domination on cardinal products of graphs
- Quasi-total Roman bondage number in graphs
- On the Italian reinforcement number of a digraph
- Algorithm and hardness results in double Roman domination of graphs
- Weak Roman domination stable graphs upon edge-addition
- An upper bound on triple Roman domination
- Total restrained Roman domination
- Chromatic transversal Roman domination in graphs
- Quasi total double Roman domination in trees
- Roman domination number of signed graphs
- Outer independent signed double Roman domination
- Total Roman \(\{2\}\)-reinforcement of graphs
- Further progress on the total Roman \(\{2\}\)-domination number of graphs
- A new upper bound for the perfect Italian domination number of a tree
- Restrained double Italian domination in graphs
- Total Italian domatic number of graphs
- Bounds on the double Italian domination number of a graph
- On the total and strong version for Roman dominating functions in graphs
- Edge lifting and Roman domination in graphs
- On the Roman domination subdivision number of a graph
- A proof of a conjecture on the differential of a subcubic graph
- Triple Roman domination subdivision number in graphs
- On the Zagreb indices of graphs with given Roman domination number
- Varieties of Roman Domination
- Outer independent Roman domination number of trees
- On [k]-Roman domination subdivision number of graphs
- Title not available (Why is that?)
- Bounds on signed total double Roman domination
- Restrained Roman and restrained Italian domatic numbers of graphs
- Computing strong Roman domination of trees and unicyclic graphs in linear time
- Inverse roman domination in graphs
- Disprove of a conjecture on the double Roman domination number
- Roman domination and independent Roman domination on graphs with maximum degree three
- Further results on independent double roman trees
- On the total restrained double Italian domination
- On maximal Roman domination in graphs: complexity and algorithms
- Weak double Roman domination
- Quasi total double Roman domination in graphs
- Domination parameters of generalized Sierpiński graphs
- Signed total Italian \(k\)-domination in digraphs
- Complexity issues concerning the quadruple Roman domination problem in graphs
- Outer independent total double Italian domination number
- Algorithmic aspect on total Roman \(\{2\}\)-domination of Cartesian products of paths and cycles
- Metaheuristic algorithms for solving Roman \(\{2\}\)-domination problem
- New bounds on the outer-independent total double Roman domination number
This page was built for publication: Varieties of Roman domination. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4956207)
