Irredundance, secure domination and maximum degree in trees

DOI10.1016/j.disc.2006.05.037zbMath1233.05143OpenAlexW2050229504MaRDI QIDQ861788

E. J. Cockayne

Publication date: 2 February 2007

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

Full work available at URL: https://doi.org/10.1016/j.disc.2006.05.037

zbMATH Keywords

treemaximum degreesecure domination numberirredundance number

Mathematics Subject Classification ID

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

Related Items (18)

Upper secure domination number of a graph ⋮ Further results on secure restrained domination in graphs ⋮ Secure equitability in graphs ⋮ On computing a minimum secure dominating set in block graphs ⋮ The complexity of secure domination problem in graphs ⋮ A linear algorithm for secure domination in trees ⋮ The secure domination problem in cographs ⋮ A characterization of trees with equal independent domination and secure domination numbers ⋮ Edge criticality in secure graph domination ⋮ Secure domination in rooted product graphs ⋮ Secure restrained domination in graphs ⋮ Irredundance ⋮ Eternal and Secure Domination in Graphs ⋮ SECURE DOMINATING SETS IN THE LEXICOGRAPHIC PRODUCT OF GRAPHS ⋮ On minimum secure dominating sets of graphs ⋮ On secure domination in trees ⋮ Secure domination critical graphs ⋮ Co-Roman domination in graphs

Cites Work

• Irredundance and Maximum Degree in Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Irredundance, secure domination and maximum degree in trees