Secure domination in proper interval graphs

DOI10.1016/j.dam.2018.03.040zbMath1394.05085OpenAlexW2796426100MaRDI QIDQ1671314

Toru Araki, Hiroka Miyazaki

Publication date: 6 September 2018

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

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

zbMATH Keywords

linear time algorithmdominationproper interval graphssecure dominationpowers of a path

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (14)

Secure domination in cographs ⋮ Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The secure domination problem in cographs ⋮ Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee ⋮ A simple algorithm for secure domination in proper interval graphs ⋮ Efficient algorithms for independent Roman domination on some classes of graphs ⋮ Algorithmic complexity of outer independent Roman domination and outer independent total Roman domination ⋮ The complexity of the defensive domination problem in special graph classes ⋮ Total Roman domination for proper interval graphs ⋮ A linear algorithm for double Roman domination of proper interval graphs ⋮ Eternal and Secure Domination in Graphs ⋮ The co-secure domination in proper interval graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of trees with equal independent domination and secure domination numbers
• Secure domination critical graphs
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Algorithmic graph theory and perfect graphs
• On secure domination in graphs
• Optimal greedy algorithms for indifference graphs
• A linear algorithm for secure domination in trees
• Secure restrained domination in graphs
• Vertex Covers and Secure Domination in Graphs
• Secure domination and secure total domination in graphs
• On minimum secure dominating sets of graphs
• On secure domination in trees

This page was built for publication: Secure domination in proper interval graphs