A simple algorithm for secure domination in proper interval graphs

DOI10.1016/J.DAM.2019.01.012MaRDI QIDQ1741524zbMATH OpenOpenAlexWikidataFDO

Authors Xianqiang Yang

Publication date 3 May 2019

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2019.01.012

zbMATH Keywords

dominationproper interval graphssecure domination

Mathematics Subject Classification ID

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

Recommendations

• Secure domination in proper interval graphs
• The co-secure domination in proper interval graphs
• On secure domination in graphs
• Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang
• Secure domination and secure total domination in graphs
• Algorithmic aspects of secure connected domination in graphs
• Two algorithms for secure graph domination
• Algorithmic results in secure total dominating sets on graphs
• The complexity of secure domination problem in graphs
• Algorithmic complexity of secure connected domination in graphs

Cites work

• Optimal greedy algorithms for indifference graphs
• Secure domination in proper interval graphs
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Cited in

(8)

• Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang
• Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee
• The co-secure domination in proper interval graphs
• Secure domination in rooted product graphs
• A lower bound for secure domination number of an outerplanar graph
• PTASs for secure dominating set in planar graphs and growth-bounded graphs
• scientific article; zbMATH DE number 7613130 (Why is no real title available?)
• Secure total domination number in maximal outerplanar graphs

This page was built for publication: A simple algorithm for secure domination in proper interval graphs

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