A lower bound for secure domination number of an outerplanar graph

DOI10.1016/j.dam.2024.05.032zbMATH Open1548.0525MaRDI QIDQ6611009

Toru Araki

Publication date: 26 September 2024

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

zbMATH Keywords

lower boundouterplanar graphsecure domination numbersecure dominating set

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• On dominating sets of maximal outerplanar and planar graphs
• Secure domination in proper interval graphs
• On the secure domination numbers of maximal outerplanar graphs
• On computing a minimum secure dominating set in block graphs
• The secure domination problem in cographs
• A simple algorithm for secure domination in proper interval graphs
• Dominating sets in planar graphs
• On dominating sets of maximal outerplanar graphs
• Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee
• On secure domination in graphs
• Secure domination in cographs
• Dominating sets of maximal outerplanar graphs
• A linear algorithm for secure domination in trees
• Vertex Covers and Secure Domination in Graphs
• On minimum secure dominating sets of graphs
• On secure domination in trees
• Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang
• Secure total domination number in maximal outerplanar graphs

This page was built for publication: A lower bound for secure domination number of an outerplanar graph