The differential and the roman domination number of a graph
From MaRDI portal
Publication:2969170
Recommendations
- On the differential and Roman domination number of a graph with minimum degree two
- On the Roman domination number of a graph
- The distance Roman domination numbers of graphs
- On the Roman domination polynomial of graphs
- On the Roman edge domination number of a graph
- Bounds on Roman domination numbers of graphs
- Double Roman domination and domatic numbers of graphs
- scientific article; zbMATH DE number 7478592
- On the total Roman domination number of graphs.
- The Roman domination number of some special classes of graphs - convex polytopes
Cited in
(35)- On maximal Roman domination in graphs
- On the 2-packing differential of a graph
- Differential in complementary prisms
- 1-well-covered graphs revisited
- Minimal Roman dominating functions: extensions and enumeration
- Perfect double Roman domination of trees
- The Roman domination number of some special classes of graphs - convex polytopes
- On the differential and Roman domination number of a graph with minimum degree two
- On the signed Roman \(k\)-domination: complexity and thin torus graphs
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability
- On the roman domination number of generalized Sierpiński graphs
- Double Roman domination number
- Some progress on the double Roman domination in graphs
- On the complexity landscape of the domination chain
- Unique response Roman domination versus 2-packing differential in complementary prisms
- A Nordhaus-Gaddum bound for Roman domination
- Data reductions and combinatorial bounds for improved approximation algorithms
- Mixed Roman domination in graphs
- Outer independent Roman dominating functions in graphs
- The differential of the line graph \(\mathcal{L} (G)\)
- Extremal graphs for a bound on the Roman domination number
- \(\beta\)-differential of a graph
- Roman domination in graphs: the class \(\mathcal{R}_{UVR}\)
- Minimal Roman dominating functions: extensions and enumeration
- Roman domination in graphs
- From the strong differential to Italian domination in graphs
- \(A\)-differentials and total domination in graphs
- Combinatorics for smaller kernels: the differential of a graph
- On the perfect differential of a graph
- On the differential polynomial of a graph
- Double Roman domination
- A proof of a conjecture on the differential of a subcubic graph
- On the D-differential of a graph
- A Roman domination chain
- The differential on graph operator \(\mathrm{R}(G)\)
This page was built for publication: The differential and the roman domination number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2969170)