Bibliographic Details
| Title: |
A linear algorithm for secure domination in trees. |
| Authors: |
Burger, A.P.1 apburger@sun.ac.za, de Villiers, A.P.1 antondev@sun.ac.za, van Vuuren, J.H.2 vuuren@sun.ac.za |
| Source: |
Discrete Applied Mathematics. Jul2014, Vol. 171, p15-27. 13p. |
| Subjects: |
Linear statistical models, Dominating set, Set theory, Graph theory, Algorithms |
| Abstract: |
Abstract: A subset of the vertex set of a graph is a secure dominating set of if is a dominating set of and if, for each vertex not in , there is a neighbouring vertex of in such that the swap set is again a dominating set of . The secure domination number of , denoted by , is the cardinality of a smallest secure dominating set of . A linear algorithm is proposed in this paper for finding a minimum secure dominating set and hence the value for a tree . The algorithm is based on a strategy of repeatedly pruning away pendent spiders of after having dominated them securely. [Copyright &y& Elsevier] |
|
Copyright of Discrete Applied Mathematics is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
