On secure domination in trees

DOI10.2989/16073606.2016.1259188zbMath1423.05125OpenAlexW2594707469MaRDI QIDQ5236045

Jin Xu, Zepeng Li, Zehui Shao

Publication date: 15 October 2019

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2989/16073606.2016.1259188

zbMATH Keywords

treesecure domination numbersecure dominating set

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (8)

Secure domination in proper interval graphs ⋮ On the secure domination numbers of maximal outerplanar graphs ⋮ Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang ⋮ The secure domination problem in cographs ⋮ Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee ⋮ Secure domination in rooted product graphs ⋮ Eternal and Secure Domination in Graphs ⋮ The co-secure domination in proper interval graphs

Cites Work

• Irredundance, secure domination and maximum degree in trees
• Secure domination critical graphs
• On secure domination in graphs
• A linear algorithm for secure domination in trees
• Vertex Covers and Secure Domination in Graphs
• Secure domination and secure total domination in graphs
• On minimum secure dominating sets of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On secure domination in trees