Bibliographic Details
| Title: |
Bounds on a graph's security number |
| Authors: |
Dutton, Ronald D.1 dutton@cs.ucf.edu, Lee, Robert1, Brigham, Robert C.1 |
| Source: |
Discrete Applied Mathematics. Mar2008, Vol. 156 Issue 5, p695-704. 10p. |
| Subjects: |
Graph theory, Algebra, Combinatorics, Topology |
| Abstract: |
Abstract: Let be a graph. A set is a defensive alliance if for every . Thus, each vertex of a defensive alliance can, with the aid of its neighbors in S, be defended from attack by its neighbors outside of S. An entire set S is secure if any subset , not just singletons, can be defended from an attack from outside of S, under an appropriate definition of what such a defense implies. The security number of G is the cardinality of a smallest secure set. Bounds on are presented. [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 |
