Perfect secure domination in graphs
From MaRDI portal
Publication:5368928
zbMATH Open1374.05174MaRDI QIDQ5368928FDOQ5368928
Authors: S. V. Divya Rashmi, S. Arumugam, Kiran R. Bhutani, Peter Gartland 
Publication date: 11 October 2017
Recommendations
Cited In (22)
- 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 parameters of Halin graph with perfect \(k\)-ary tree
- Secure domination in rooted product graphs
- Secure Italian domination in graphs
- Eternal and Secure Domination in Graphs
- Secure domination subdivision number of a graph
- Protection of a network by complete secure domination
- Title not available (Why is that?)
- Secure equitability in graphs
- Upper secure domination number of a graph
- 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
- Private domination number of a graph
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)
