Name
Abstract | ||
|---|---|---|
Let G=(V,E) be a graph and S⊆V. The set S is a secure set if ∀X⊆S,|N[X]∩S|≥|N[X]−S|, and S is a global secure set if S is a secure set and a dominating set. The cardinality of a minimum global secure set of G is the global security number of G, denoted γs(G). The sets studied in this paper are different from secure dominating sets studied in Cockayne et al. (2003) [3], Grobler and Mynhardt (2009) [8], or Klostermeyer and Mynhardt (2008) [13], which are also denoted by γs. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.dam.2010.12.013 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Security number,Dominating set,Cycle,Cartesian product,Grid graph | Graph,Discrete mathematics,Dominating set,Combinatorics,Cartesian product,Cardinality,Lattice graph,Mathematics,Grid | Journal |
Volume | Issue | ISSN |
159 | 6 | 0166-218X |
Citations | PageRank | References |
4 | 0.50 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yiu Yu Ho | 1 | 4 | 0.50 |
| Ronald D. Dutton | 2 | 190 | 27.80 |