Upper secure domination number of a graph
From MaRDI portal
Publication:327666
DOI10.1016/J.ENDM.2016.05.025zbMATH Open1347.05139OpenAlexW2513388465MaRDI QIDQ327666FDOQ327666
Authors: S. V. Divya Rashmi, A. Somasundaram, S. Arumugam 
Publication date: 19 October 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2016.05.025
Recommendations
Cites Work
- Defending the Roman Empire---a new strategy
- Title not available (Why is that?)
- Title not available (Why is that?)
- Vertex Covers and Secure Domination in Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Irredundance, secure domination and maximum degree in trees
Cited In (14)
- Secure domination of some graph operators
- Vertex Covers and Secure Domination in Graphs
- On the secure domination numbers of maximal outerplanar graphs
- Graphs with equal domination and certified domination numbers
- Title not available (Why is that?)
- Global secure domination in graphs
- Eternal and Secure Domination in Graphs
- A lower bound for secure domination number of an outerplanar graph
- Secure domination subdivision number of a graph
- Secure domination in proper interval graphs
- Secure domination in middle graphs
- Equalityof Secure Domination and Inverse Secure Domination Numbers
- Perfect secure domination in graphs
- Private domination number of a graph
This page was built for publication: Upper secure domination number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q327666)
