Algorithmic aspects of total Roman and total double Roman domination in graphs
type: Item
instance of: scholarly article
title: Algorithmic aspects of total Roman and total double Roman domination in graphs
DOI: 10.1007/978-3-030-67899-9_3
author: Chakradhar Padamutham
author: Venkata Subba Reddy Palagiri
publication date: 2022-03-24T00:00:00Z
Mathematics Subject Classification ID: 68Wxx
zbMATH DE Number: 7497519
zbMATH Keywords: total Roman domination
zbMATH Keywords: total double Roman domination
zbMATH Keywords: APX-complete
MaRDI profile type: Publication
full work available at URL: 978-3-030-67899-9 3
OpenAlex ID: W3127008891
cites work: Total Roman domination in graphs
cites work: On the double Roman domination in graphs
cites work: Triple Roman domination in graphs
cites work: Outer independent double Roman domination
cites work: Signed double Roman domination in graphs
cites work: Some APX-completeness results for cubic graphs
cites work: Q4595656
cites work: Double Roman domination number
cites work: Total Roman domination in the lexicographic product of graphs
cites work: Approximation hardness of dominating set problems in bounded degree graphs
cites work: Roman domination in graphs.
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: On the Roman domination number of a graph
cites work: Total double Roman domination in graphs
cites work: Q4368728
cites work: Total Domination in Graphs
cites work: Defending the Roman Empire from multiple attacks
cites work: Defending the Roman Empire---a new strategy
cites work: A characterization of Roman trees
cites work: Efficient algorithms for Roman domination on some classes of graphs
cites work: Roman domination on strongly chordal graphs
cites work: Threshold graphs and related topics
cites work: Complexity of Roman {2}-domination and the double Roman domination in graphs
cites work: Algorithmic aspects of Roman domination in graphs
cites work: Optimization, approximation, and complexity classes
cites work: Algorithmic and complexity aspects of problems related to total Roman domination for graphs
cites work: Q4918118
cites work: Double Roman domination
cites work: Defendens Imperium Romanum: A Classical Problem in Military Strategy
cites work: Algorithms and Computation
cites work: Node-and edge-deletion NP-complete problems
description: scientific article; zbMATH DE number 7497519