Hardness results of global Roman domination in graphs
type: Item
instance of: scholarly article
title: Hardness results of global Roman domination in graphs
DOI: 10.1007/978-3-030-67899-9_39
author: B. S. Panda
author: Pooja Goyal
publication date: 2022-03-24T00:00:00Z
Mathematics Subject Classification ID: 68Wxx
zbMATH DE Number: 7497555
zbMATH Keywords: global Roman domination
zbMATH Keywords: NP-complete
zbMATH Keywords: approximation algorithm
MaRDI profile type: MaRDI publication profile
full work available at URL: 978-3-030-67899-9 39
OpenAlex ID: W3128085997
cites work: Global Roman domination in trees
cites work: Roman domination in graphs.
cites work: Q3651735
cites work: Analytical approach to parallel repetition
cites work: Q4368729
cites work: Q4368728
cites work: Q4198056
cites work: Roman domination on strongly chordal graphs
cites work: Global Roman domination in graphs
Recommended article: Hardness results of global Roman domination in graphs
Recommended article: Global Roman domination in graphs
Recommended article: On the global Roman domination number in graphs
Recommended article: Global total Roman domination in graphs
Recommended article: Hardness and approximation results of Roman \{3\}-domination in graphs
Recommended article: On roman, global and restrained domination in graphs
Recommended article: Roman \(k\)-domination: hardness, approximation and parameterized results
Recommended article: Algorithm and hardness results in double Roman domination of graphs
Recommended article: On total Roman domination in graphs
Recommended article: Hardness results of global total \(k\)-domination problem in graphs
description: scientific article; zbMATH DE number 7497555