The differential and the roman domination number of a graph
From MaRDI portal
Publication:2969170
DOI10.2298/AADM140210003BzbMath1464.05280OpenAlexW2059179208MaRDI QIDQ2969170
Sergio Bermudo, Henning Fernau, José María Sigarreta-Almira
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
line graphapproximation algorithmsdomination numberparameterized algorithmsRoman dominationdifferential
Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)
Related Items
Some progress on the double Roman domination in graphs ⋮ Outer independent Roman dominating functions in graphs ⋮ Double Roman domination ⋮ On the perfect differential of a graph ⋮ The differential of the line graph \(\mathcal{L} (G)\) ⋮ Extremal graphs for a bound on the Roman domination number ⋮ 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 ⋮ Mixed Roman domination in graphs ⋮ Minimal Roman dominating functions: extensions and enumeration ⋮ Differential in complementary prisms ⋮ On the D-differential of a graph ⋮ Data reductions and combinatorial bounds for improved approximation algorithms ⋮ Combinatorics for smaller kernels: the differential of a graph ⋮ On the differential polynomial of a graph ⋮ From the strong differential to Italian domination in graphs ⋮ Double Roman domination number ⋮ A proof of a conjecture on the differential of a subcubic graph ⋮ On maximal Roman domination in graphs ⋮ On the Complexity Landscape of the Domination Chain ⋮ A Roman domination chain ⋮ Roman Domination in Graphs ⋮ Roman domination in graphs: The class ℛUV R ⋮ The Roman domination number of some special classes of graphs - convex polytopes ⋮ 1-well-covered graphs revisited ⋮ Perfect double Roman domination of trees ⋮ A Nordhaus–Gaddum bound for Roman domination ⋮ \(\beta\)-differential of a graph ⋮ On the roman domination number of generalized Sierpiński graphs
