Efficient algorithms for independent Roman domination on some classes of graphs

DOI10.22049/cco.2021.27305.1228zbMath1524.05225OpenAlexW3212412127MaRDI QIDQ6097713

Abolfazl Poureidi

Publication date: 7 June 2023

Full work available at URL: http://comb-opt.azaruniv.ac.ir/article_14323.html

zbMATH Keywords

treealgorithmunicyclic graphproper interval graphindependent Roman dominating function

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 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 domination on strongly chordal graphs
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Roman domination in graphs.
• Secure domination in proper interval graphs
• Optimal greedy algorithms for indifference graphs
• The number of independent sets in unicyclic graphs
• Complexity aspects of variants of independent Roman domination in graphs
• Strong equality between the Roman domination and independent Roman domination numbers in trees
• Independent domination in directed graphs
• Outer independent Roman domination number of trees
• On trees with equal Roman domination and outer-independent Roman domination numbers

This page was built for publication: Efficient algorithms for independent Roman domination on some classes of graphs