The differential and the roman domination number of a graph
DOI10.2298/AADM140210003BzbMATH Open1464.05280OpenAlexW2059179208MaRDI QIDQ2969170FDOQ2969170
Authors: Sergio Bermudo, Henning Fernau, Jose M. Sigarreta 
Publication date: 14 March 2017
Published in: Applicable Analysis and Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/aadm140210003b
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
differentialdomination numberapproximation algorithmsline graphRoman dominationparameterized algorithms
Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cited In (35)
- On the signed Roman \(k\)-domination: complexity and thin torus graphs
- Unique response Roman domination versus 2-packing differential in complementary prisms
- On the differential polynomial of a graph
- \(A\)-differentials and total domination in graphs
- On the D-differential of a graph
- Combinatorics for smaller kernels: the differential of a graph
- Minimal Roman dominating functions: extensions and enumeration
- From the strong differential to Italian domination in graphs
- \(\beta\)-differential of a graph
- On the differential and Roman domination number of a graph with minimum degree two
- On the complexity landscape of the domination chain
- A Roman domination chain
- A Nordhaus-Gaddum bound for Roman domination
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability
- On the 2-packing differential of a graph
- Data reductions and combinatorial bounds for improved approximation algorithms
- Double Roman domination
- Outer independent Roman dominating functions in graphs
- The Roman domination number of some special classes of graphs - convex polytopes
- On maximal Roman domination in graphs
- The differential of the line graph \(\mathcal{L} (G)\)
- Extremal graphs for a bound on the Roman domination number
- Perfect double Roman domination of trees
- Mixed Roman domination in graphs
- A proof of a conjecture on the differential of a subcubic graph
- On the roman domination number of generalized Sierpiński graphs
- The differential on graph operator \(\mathrm{R}(G)\)
- Some progress on the double Roman domination in graphs
- Minimal Roman dominating functions: extensions and enumeration
- Roman domination in graphs
- Double Roman domination number
- Roman domination in graphs: the class \(\mathcal{R}_{UVR}\)
- On the perfect differential of a graph
- Differential in complementary prisms
- 1-well-covered graphs revisited
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)
