Roman Domination in Graphs
From MaRDI portal
Publication:3384614
DOI10.1007/978-3-030-51117-3_11zbMath1479.05255MaRDI QIDQ3384614
Nader Jafari Rad, Lutz Volkmann, Mustapha Chellali, Seyyed Mahmoud Sheikholeslami
Publication date: 15 December 2021
Published in: Topics in Domination in Graphs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-51117-3_11
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Properties of double Roman domination on cardinal products of graphs, Remarks on the outer-independent double Italian domination number, Outer independent Roman domination number of trees, On the outer-independent double Italian domination number, Graphs whose weak Roman domination number increases by the deletion of any edge, Double Roman reinforcement number in graphs, Quadruple Roman domination in graphs, Double Roman domination subdivision number in graphs, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Further results on the independent Roman domination number of graphs, On the outer independent total double Roman domination in graphs, Triple Roman domination subdivision number in graphs, Connected certified domination edge critical and stable graphs, Total Italian domatic number of graphs, Quasi-total Roman bondage number in graphs, On [k-Roman domination subdivision number of graphs], Further results on independent double roman trees, Quasi-total Roman reinforcement in graphs, Disprove of a conjecture on the double Roman domination number, Roman domination and independent Roman domination on graphs with maximum degree three, On [ k -Roman domination in graphs], New results on quadruple Roman domination in graphs, A Note on Roman $k$-tuple domination number, On the Zagreb indices of graphs with given Roman domination number, A counterexample to a conjecture of Jafari Rad and Volkmann, On the Roman domination subdivision number of a graph, A proof of a conjecture on the differential of a subcubic graph, Some progress on the restrained Roman domination, Restrained Roman and restrained Italian domatic numbers of graphs, Computing strong Roman domination of trees and unicyclic graphs in linear time, Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle, Improved bounds on the \(k\)-tuple (Roman) domination number of a graph, Complexity of signed total \(k\)-Roman domination problem in graphs, On the Italian reinforcement number of a digraph, Outer independent signed double Roman domination, The Roman domatic problem in graphs and digraphs: a survey, A new upper bound for the perfect Italian domination number of a tree, Further progress on the total Roman \(\{2\}\)-domination number of graphs, Bounds on the double Italian domination number of a graph, On algorithmic complexity of double Roman domination, Maximal double Roman domination in graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Averaging 2-rainbow domination and Roman domination
- Computing Roman domatic number of graphs
- Upper bounds for domination related parameters in graphs on surfaces
- Roman domination on strongly chordal graphs
- On the roman domination in the lexicographic product of graphs
- Roman domination number of the Cartesian products of paths and cycles
- Domination alteration sets in graphs
- Roman domination subdivision number of graphs
- Roman domination dot-critical trees
- On the Roman \(k\)-bondage number of a graph
- On the Roman bondage number of planar graphs
- On roman, global and restrained domination in graphs
- Upper bounds on Roman domination numbers of graphs
- Domination, independent domination, and duality in strongly chordal graphs
- A note on Roman domination in graphs
- Rainbow domination in graphs
- Upper bounds for the Roman domination subdivision number of a graph
- Note on 2-rainbow domination and Roman domination in graphs
- The roman domatic number of a graph
- Efficient algorithms for Roman domination on some classes of graphs
- Roman domination in regular graphs
- On the Roman domination number of a graph
- Roman domination in graphs.
- Some results on roman domination edge critical graphs
- An improvement on Vizing's conjecture
- Difference between 2-rainbow domination and roman domination in graphs
- On bondage numbers of graphs: a survey with some comments
- Extremal graphs for a bound on the Roman domination number
- Total Roman reinforcement in graphs
- A note on the Roman bondage number of planar graphs
- Roman domination dot-critical graphs
- On the Roman domination stable graphs
- On the differential and Roman domination number of a graph with minimum degree two
- On the corona of two graphs
- Defendens Imperium Romanum: A Classical Problem in Military Strategy
- Roman domination in graphs: The class ℛUV R
- Roman Bondage Numbers of Some Graphs
- Roman Domination on 2-Connected Graphs
- Roman bondage in graphs
- Trees with unique Roman dominating functions of minimum weight
- Roman domination number of Generalized Petersen Graphs P(n,2)
- Roman domination number on cardinal product of paths and cycles
- Roman and Total Domination
- The differential and the roman domination number of a graph
- Some results for Roman domination number on Cardinal product of paths and cycles
- On Complementary Graphs
- Extremal Problems for Roman Domination
- Properties of Hereditary Hypergraphs and Middle Graphs
- A characterization of Roman trees
- Roman domination excellent graphs: trees
- Total Domination in Graphs
- Upper bounds for the domination subdivision and bondage numbers of graphs on topological surfaces
- ON THE ROMAN BONDAGE NUMBER OF A GRAPH
- Critical graphs with Roman domination number four
- A Nordhaus–Gaddum bound for Roman domination
- Roman domination in Cartesian product graphs and strong product graphs
- Lower bounds on the Roman and independent Roman domination numbers
- A Roman domination chain
