A simple algorithm for secure domination in proper interval graphs

DOI10.1016/j.dam.2019.01.012zbMath1409.05152OpenAlexW2913610756WikidataQ128359632 ScholiaQ128359632MaRDI QIDQ1741524

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)

Related Items (4)

Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang ⋮ Unnamed Item ⋮ Secure domination in rooted product graphs ⋮ The co-secure domination in proper interval graphs

Cites Work

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

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