A characterization of trees with equal independent domination and secure domination numbers
Authors:
- Zepeng LiZLZepeng Li
- Jin XuJXJin Xu
- 1 March 2017
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 119, 14-18
Abstract
No abstract availableFunding Information
- National Natural Science Foundation of China (61672050, 61472012, 61572046, 61502012)
- National Basic Research Program (973 Program) of China (2013CB329600)
- China Postdoctoral Science Foundation (2016M591013)
This publication has 6 references indexed in Scilit:
- On Secure Domination in GraphsInformation Processing Letters, 2015
- A linear algorithm for secure domination in treesDiscrete Applied Mathematics, 2014
- Secure domination critical graphsDiscrete Mathematics, 2009
- Vertex Covers and Secure Domination in GraphsQuaestiones Mathematicae, 2008
- Secure domination and secure total domination in graphsDiscussiones Mathematicae Graph Theory, 2008
- Irredundance, secure domination and maximum degree in treesDiscrete Mathematics, 2007