Varieties of Roman Domination
From MaRDI portal
Publication:3384116
DOI10.1007/978-3-030-58892-2_10zbMath1479.05253OpenAlexW3043697555MaRDI QIDQ3384116
Nader Jafari Rad, Mustapha Chellali, Lutz Volkmann, Seyyed Mahmoud Sheikholeslami
Publication date: 14 December 2021
Published in: Developments in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-58892-2_10
Related Items
Outer independent Roman domination number of trees, On the Italian reinforcement number of a digraph, On the outer-independent double Italian domination number, 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, On the outer independent total double Roman domination in graphs, Triple Roman domination subdivision number in graphs, Graphs whose weak Roman domination number increases by the deletion of any edge, Total Italian domatic number of graphs, Approximation algorithm for (connected) Italian dominating function, 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, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, On the Zagreb indices of graphs with given Roman domination number, Total Roman \(\{2\}\)-reinforcement of graphs, Restrained Roman and restrained Italian domatic numbers of graphs, Computing strong Roman domination of trees and unicyclic graphs in linear time, On the total Roman domination stability in graphs, Double Roman reinforcement number in graphs, Quadruple Roman domination in graphs, Double Roman domination in graphs with minimum degree at least two and no \(C_5\)-cycle, Double Roman domination subdivision number 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
- Roman \(\{2 \}\)-domination
- Strong equality of Roman and weak Roman domination in trees
- Double Roman domination
- Edge Roman domination on graphs
- Roman domination on strongly chordal graphs
- Italian domination in trees
- Bounds on weak Roman and 2-rainbow domination numbers
- A note on the k-domination number of a graph
- Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number
- Roman domination in graphs.
- Upper bounds for \(f\)-domination number of graphs
- Some progress on the double Roman domination in graphs
- Extremal problems on weak Roman domination number
- Perfect Roman domination in trees
- Independent Roman \(\{2 \}\)-domination in graphs
- Nordhaus-Gaddum bounds for total Roman domination
- Double Roman domination in trees
- On the total Roman domination in trees
- A characterization of double Roman trees
- Perfect Italian domination in trees
- Defending the Roman Empire---a new strategy
- A characterization of perfect Roman trees
- On algorithmic complexity of double Roman domination
- Perfect Italian domination on planar and regular graphs
- Graphs with large Italian domination number
- Critical concepts in domination
- Algorithmic and complexity aspects of problems related to total Roman domination for graphs
- Total Roman reinforcement in graphs
- On perfect Roman domination number in trees: complexity and bounds
- An improved upper bound on the double Roman domination number of graphs with minimum degree at least two
- On the strong Roman domination number of graphs
- On the double Roman domination in graphs
- Exact algorithms for weak Roman domination
- Total Roman domination in the lexicographic product of graphs
- On graphs with equal domination and 2-domination numbers
- Upper bounds on the \(k\)-tuple (Roman) domination number of a graph
- Trees with independent Roman domination number twice the independent domination number
- A CORRECTION TO A PAPER ON ROMAN κ-DOMINATION IN GRAPHS
- Strong equality between the Roman domination and independent Roman domination numbers in trees
- A note on k-Roman graphs
- Relations between the Roman k-domination and Roman domination numbers in graphs
- Weak Roman domination in graphs
- ROMAN k-DOMINATION IN GRAPHS
- Paired-domination in graphs
- Double Roman domination and domatic numbers of graphs
- A note on the characterization of domination perfect graphs
- Varieties of Roman domination II
- A note on the edge Roman domination in trees
- A Taxonomy of Perfect Domination
- Protection of graphs with emphasis on Cartesian product graphs
- Perfect roman domination in regular graphs
- A characterization of trees with equal Roman $\{2\}$-domination and Roman domination numbers
- On Hop Roman Domination in Trees
- Lower bounds on the Roman and independent Roman domination numbers
- Total Roman domination in graphs
- An upper bound on the double Roman domination number
- The double Roman domination numbers of generalized Petersen graphs \(P(n, 2)\)
