Perfect secure domination in graphs

MaRDI QIDQ5368928zbMATH OpenFDO

Authors S. V. Divya Rashmi, S. Arumugam, Kiran R. Bhutani, Peter Gartland

Publication date 11 October 2017

zbMATH Keywords

secure setdomination setperfect secure dominating number

Mathematics Subject Classification ID

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

Recommendations

• Upper secure domination number of a graph
• Global secure domination in graphs
• scientific article; zbMATH DE number 933213
• On minimum secure dominating sets of graphs
• scientific article; zbMATH DE number 5553874

Cited in

(22)

• Private domination number of a graph
• On minimum secure dominating sets of graphs
• Complexity issues of perfect secure domination in graphs
• Secure domination of some graph operators
• Vertex Covers and Secure Domination in Graphs
• On the secure domination numbers of maximal outerplanar graphs
• Global secure domination in graphs
• Secure domination in rooted product graphs
• Secure Italian domination in graphs
• Secure domination parameters of Halin graph with perfect \(k\)-ary tree
• Eternal and Secure Domination in Graphs
• Secure domination subdivision number of a graph
• Protection of a network by complete secure domination
• Upper secure domination number of a graph
• scientific article; zbMATH DE number 2188623 (Why is no real title available?)
• Secure equitability in graphs
• Perfect secret sharing scheme based on vertex domination set
• Secure domination in middle graphs
• Equalityof Secure Domination and Inverse Secure Domination Numbers
• Secure domination of honeycomb networks
• DUAL-PERFECT DOMINATION IN GRAPHS
• Edge stability in secure graph domination

This page was built for publication: Perfect secure domination in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5368928)