Algorithmic Aspects of Quasi-Total Roman Domination in Graphs

DOI10.22049/CCO.2021.27126.1200zbMath1524.05221OpenAlexW3217064762MaRDI QIDQ6158956

No author found.

Publication date: 1 June 2023

Full work available at URL: http://comb-opt.azaruniv.ac.ir/article_14220_e1aeb63f7a60db0a40f1bdb4295ae39a.pdf

zbMATH Keywords

linear programmingdomination numbercomplexity classesgraph classesquasi-total Roman domination

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Quasi-total Roman bondage number in graphs ⋮ Quasi-total Roman reinforcement in graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Counting independent sets in tree convex bipartite graphs
• Efficient algorithms for Roman domination on some classes of graphs
• On the Roman domination number of a graph
• Defending the Roman Empire from multiple attacks
• Roman domination in graphs.
• Defending the Roman Empire---a new strategy
• Threshold graphs and related topics
• Quasi-total Roman domination in graphs
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• The Complexity of the Partial Order Dimension Problem
• Graph Classes: A Survey
• A characterization of Roman trees
• Algorithms and Computation

This page was built for publication: Algorithmic Aspects of Quasi-Total Roman Domination in Graphs