Upper secure domination number of a graph

DOI10.1016/j.endm.2016.05.025zbMath1347.05139OpenAlexW2513388465MaRDI QIDQ327666

S. Arumugam, S. V. Divya Rashmi, A. Somasundaram

Publication date: 19 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.05.025

zbMATH Keywords

secure dominationsecure domination numberupper secure domination number

Mathematics Subject Classification ID

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

Related Items (1)

Eternal and Secure Domination in Graphs

Cites Work

• Irredundance, secure domination and maximum degree in trees
• Defending the Roman Empire---a new strategy
• Vertex Covers and Secure Domination in Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Upper secure domination number of a graph