ROMAN DOMINATION AND ITS VARIANTS IN UNIT DISK GRAPHS
From MaRDI portal
Publication:3560065
DOI10.1142/S1793830910000504zbMATH Open1209.68652MaRDI QIDQ3560065FDOQ3560065
Authors: Xiumei Wang, Xiaodong Hu, Weiping Shang 
Publication date: 19 May 2010
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Recommendations
- Roman domination in unicyclic graphs
- Roman domination in graphs
- A note on Roman domination in graphs
- A note on Roman domination in graphs
- Roman domination in regular graphs
- On total Roman domination in graphs
- Roman \(k\)-domination in graphs
- On the Roman domination stable graphs
- Roman lict domination in graphs
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)
Cites Work
Cited In (11)
- Approximation algorithm for the minimum partial connected Roman dominating set problem
- Minimal Roman dominating functions: extensions and enumeration
- Bisectored unit disk graphs
- ON THE ROMAN BONDAGE NUMBER OF A GRAPH
- Binary programming formulations for the upper domination problem
- Approximation algorithm for (connected) Italian dominating function
- Domination parameters with number 2: interrelations and algorithmic consequences
- Nearly tight approximation algorithm for (connected) Roman dominating set
- Minimal Roman dominating functions: extensions and enumeration
- Approximation algorithm for a generalized Roman domination problem in unit ball graphs
- Roman domination and independent Roman domination on graphs with maximum degree three
This page was built for publication: ROMAN DOMINATION AND ITS VARIANTS IN UNIT DISK GRAPHS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3560065)
