Algorithmic aspects of Roman graphs

DOI10.22044/JAS.2020.8188.1400zbMATH Open1468.05285OpenAlexW3199205563MaRDI QIDQ4956471FDOQ4956471

Authors: Abolfazl Poureidi 

Publication date: 2 September 2021

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

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

zbMATH Keywords

algorithmdominating setunicyclic graph3-SAT problemRoman dominating function

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Roman domination in graphs.
• Roman \(\{2 \}\)-domination
• Efficient algorithms for Roman domination on some classes of graphs
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• A characterization of Roman trees
• Double Roman domination
• Some progress on the double Roman domination in graphs
• Double Roman domination in trees
• On the double Roman domination of graphs
• On the double Roman domination in graphs

Cited In (3)

• Graph-Theoretic Concepts in Computer Science
• Computing Roman domatic number of graphs
• Efficient algorithms for Roman domination on some classes of graphs

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)