Extremal problems for roman domination
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- On the Roman domination number of a graph
- Roman domination in graphs.
- A note on Roman domination of digraphs
- Some progress on the double Roman domination in graphs
- Extremal problems on weak Roman domination number
- Perfect Roman domination in trees
- Weak \(\{2\}\)-domination number of Cartesian products of cycles
- Nordhaus-Gaddum bounds for total Roman domination
- On the global Roman domination number in graphs
- On the co-Roman domination in graphs
- The Roman \(\{2 \}\)-domatic number of graphs
- A characterization of double Roman trees
- Perfect Italian domination in trees
- Double Roman domination number
- A characterization of trees based on edge-deletion and its applications for domination-type invariants
- A continuous generalization of domination-like invariants
- Nearly tight approximation algorithm for (connected) Roman dominating set
- Roman \(\{2\}\)-domination problem in graphs
- A note on the bounds of Roman domination numbers
- Extremal graphs for a bound on the Roman domination number
- On the \(k\)-strong Roman domination problem
- Perfect Italian domination on planar and regular graphs
- Graphs with large Italian domination number
- Roman domination and double Roman domination numbers of Sierpiński graphs \(S(K_n,t)\)
- Double Roman domination in digraphs
- Quasi-total Roman domination in graphs
- Unique response Roman domination in graphs
- Roman \(\{2\}\)-bondage number of a graph
- Approximation algorithm for a generalized Roman domination problem in unit ball graphs
- Independent double Roman domination in graphs
- Extremal digraphs for an upper bound on the Roman domination number
- On perfect Roman domination number in trees: complexity and bounds
- On the double Roman domination of graphs
- Global Roman domination in trees
- Vertex-addition strategy for domination-like invariants
- On the strong Roman domination number of graphs
- On the Roman domination stable graphs
- On the differential and Roman domination number of a graph with minimum degree two
- Exact algorithms for weak Roman domination
- Total Roman domination in the lexicographic product of graphs
- Signed Roman domination in graphs
- On the total and strong version for Roman dominating functions in graphs
- Averaging 2-rainbow domination and Roman domination
- Roman domination in direct product graphs and rooted product graphs
- Roman domination in graphs: the class \(\mathcal{R}_{UVR}\)
- Computing Roman domatic number of graphs
- Inverse roman domination in graphs
- Roman domination on 2-connected graphs
- Relations between the Roman k-domination and Roman domination numbers in graphs
- Roman domination subdivision number of a graph and its complement.
- Roman and total domination
- The \(\mathbb{N}_k\)-valued Roman domination and its boundaries
- Double Roman domination
- Roman domination in graphs
- The Roman domination number of some special classes of graphs - convex polytopes
- Edge Roman domination on graphs
- The roman k-domatic number of a graph
- Bounds on Roman domination numbers of graphs
- Roman domination on strongly chordal graphs
- On the roman domination in the lexicographic product of graphs
- Roman domination excellent graphs: trees
- Double Roman domination and domatic numbers of graphs
- Roman domination in odd and even graphs
- Roman domination in complementary prism graphs
- On the Roman bondage number of a graph
- Critical graphs with Roman domination number four
- Independent double Roman domination in graphs
- Roman domination in oriented trees
- The signed Roman domination number of two classes graphs
- Total Roman domatic number of a graph
- Bounds on the co-Roman domination number in graphs
- Total Roman domination in digraphs
- On Roman domination number of functigraph and its complement
- Integer linear programming formulations for double Roman domination problem
- Lower and upper bounds on independent double Roman domination in trees
- Signed Roman edge k-domination in graphs
- Perfect Roman domination in regular graphs
- Italian domination in trees
- Connected graphs with maximal Roman domination number one less than their order.
- A note on the Roman domatic number of a digraph
- Trees with equal Roman \{2\}-domination number and independent Roman \{2\}-domination number
- A Nordhaus-Gaddum bound for Roman domination
- Lower bounds on the roman and independent roman domination numbers
- On maximal Roman domination in graphs
- A Roman domination chain
- Minimal Roman dominating functions: extensions and enumeration
- Total Roman domination on the digraphs
- On the Zagreb indices of graphs with given Roman domination number
- Double Roman domination number of middle graph
- Chromatic transversal Roman domination in graphs
- New results on quadruple Roman domination in graphs
- Minimal Roman dominating functions: extensions and enumeration
- Algorithmic aspect on total Roman \(\{2\}\)-domination of Cartesian products of paths and cycles
- Further results on the \([k]\)-Roman domination in graphs
- \(k\)-domination and \(k\)-independence in graphs: A survey
- Perfect Italian domination on some generalizations of cographs
- The \(l\)-distance \(k\)-rainbow domination numbers of graphs
- On the parameterized complexity of cosecure domination
- Majority double Roman domination in graphs
- Bounds for (strong) Roman k-dominations
This page was built for publication: Extremal problems for roman domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3583327)
