Algorithmic aspects of Roman graphs

DOI10.22044/JAS.2020.8188.1400MaRDI QIDQ4956471zbMATH OpenOpenAlexFDO

Authors Abolfazl Poureidi

Publication date 2 September 2021

Full work available at URL http://jas.shahroodut.ac.ir/article_2058_3654a9bd6949d46a357a1413df58873e.pdf

zbMATH Keywords

3-SAT problemalgorithmdominating setRoman dominating functionunicyclic graph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Algorithmic and complexity aspects of problems related to total Roman domination for graphs
• On algorithmic complexity of double Roman domination
• Roman domination in graphs.
• Locating Roman domination in graphs
• Roman domination in unicyclic graphs

Cites work

• A characterization of Roman trees
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• Double Roman domination
• Double Roman domination in trees
• Efficient algorithms for Roman domination on some classes of graphs
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• On the double Roman domination in graphs
• On the double Roman domination of graphs
• Roman \(\{2 \}\)-domination
• Roman domination in graphs.
• Some progress on the double Roman domination in graphs

Cited in

(8)

• Efficient algorithms for Roman domination on some classes of graphs
• Computing strong Roman domination of trees and unicyclic graphs in linear time
• On algorithmic complexity of double Roman domination
• Algorithmic and complexity aspects of problems related to total Roman domination for graphs
• Roman domination in unicyclic graphs
• Computing Roman domatic number of graphs
• Graph-Theoretic Concepts in Computer Science
• Approximation algorithm for the minimum partial connected Roman dominating set problem

This page was built for publication: Algorithmic aspects of Roman graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4956471)