Bibliographic Details
| Title: |
Global secure sets of grid-like graphs |
| Authors: |
Ho, Yiu Yu yiuyuho@gmail.com, Dutton, Ronald dutton@cs.ucf.edu |
| Source: |
Discrete Applied Mathematics. Mar2011, Vol. 159 Issue 6, p490-496. 7p. |
| Subjects: |
Set theory, Graph theory, Dominating set, Paths & cycles in graph theory, Security management |
| Abstract: |
Abstract: Let be a graph and . The set is a secure set if , and is a global secure set if is a secure set and a dominating set. The cardinality of a minimum global secure set of is the global security number of , denoted . The sets studied in this paper are different from secure dominating sets studied in Cockayne et al. (2003) , Grobler and Mynhardt (2009) , or Klostermeyer and Mynhardt (2008) , which are also denoted by . In this paper, we provide results on the global security numbers of paths, cycles and their Cartesian products. [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 |
