ALGORITHMIC ASPECTS OF ROMAN GRAPHS

DOI10.22044/jas.2020.8188.1400zbMath1468.05285OpenAlexW3199205563MaRDI QIDQ4956471

Abolfazl Poureidi

Publication date: 2 September 2021

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

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

• Unnamed Item
• Unnamed Item
• Roman \(\{2 \}\)-domination
• Double Roman domination
• Efficient algorithms for Roman domination on some classes of graphs
• Roman domination in graphs.
• 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
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• A characterization of Roman trees

This page was built for publication: ALGORITHMIC ASPECTS OF ROMAN GRAPHS