The eternal dominating set problem for proper interval graphs

DOI10.1016/J.IPL.2015.02.004MaRDI QIDQ2345856zbMATH OpenOpenAlexFDO

Authors Andrei Braga, Orlando Lee, Cid Carvalho de Souza

Publication date 21 May 2015

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2015.02.004

zbMATH Keywords

combinatorial problemseternal dominating setproper interval graphs

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The eternal dominating set problem for interval graphs
• scientific article; zbMATH DE number 5575574
• A note on the eternal dominating set problem
• Eternal domination on 3 n grid graphs
• Vertex covers and eternal dominating sets

Cites work

• A linear-time algorithm for proper interval graph recognition
• Algorithmic graph theory and perfect graphs
• Graph theory
• scientific article; zbMATH DE number 5575574 (Why is no real title available?)
• scientific article; zbMATH DE number 2174620 (Why is no real title available?)
• scientific article; zbMATH DE number 2104838 (Why is no real title available?)
• Protecting a graph with mobile guards

Cited in

(11)

• Proper interval graphs and the guard problem
• The eternal dominating set problem for interval graphs
• Algorithmic complexity of outer independent Roman domination and outer independent total Roman domination
• New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs
• Tight bounds for eternal dominating sets in graphs
• Eternal domination: \(D\)-dimensional Cartesian and strong grids and everything in between
• Eternal and Secure Domination in Graphs
• scientific article; zbMATH DE number 5575574 (Why is no real title available?)
• Total Roman domination for proper interval graphs
• A method for eternally dominating strong grids
• Fast winning strategies for the attacker in eternal domination

This page was built for publication: The eternal dominating set problem for proper interval graphs

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