A linear algorithm for double Roman domination of proper interval graphs

DOI10.1142/S1793830920500111zbMath1433.05249OpenAlexW2983527869WikidataQ126808974 ScholiaQ126808974MaRDI QIDQ5216450

Abolfazl Poureidi

Publication date: 18 February 2020

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830920500111

zbMATH Keywords

algorithmproper interval graphdouble Roman dominating function

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Outer independent double Italian domination: Complexity, characterization ⋮ Clique doubly connected domination in the join and lexicographic product of graphs

Cites Work

• Double Roman domination
• Secure domination in proper interval graphs
• Double Roman domination in trees
• New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs
• On the double Roman domination of graphs
• On the double Roman domination in graphs
• Defendens Imperium Romanum: A Classical Problem in Military Strategy
• A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs
• Unnamed Item

This page was built for publication: A linear algorithm for double Roman domination of proper interval graphs