Name
Abstract | ||
|---|---|---|
The security number of a graph is the cardinality of a smallest vertex subset of the graph such that any attack on the subset is defendable. In this paper, we determine the security number of two-dimensional cylinders and tori. This result settles a conjecture of Brigham et al. [R.C. Brigham, R.D. Dutton, S.T. Hedetniemi, Security in graphs, Discrete Appl. Math. 155 (2007) 1708–1714]. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.dam.2009.03.020 | Discrete Applied Mathematics |
Keywords | Field | DocType |
Security number,Grid,Cylinder,Torus | Graph,Discrete mathematics,Combinatorics,Vertex (geometry),Vertex (graph theory),Cardinality,Torus,Conjecture,Mathematics,Grid | Journal |
Volume | Issue | ISSN |
157 | 11 | 0166-218X |
Citations | PageRank | References |
8 | 0.68 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kyohei Kozawa | 1 | 23 | 3.21 |
| Yota Otachi | 2 | 161 | 37.16 |
| Koichi Yamazaki | 3 | 222 | 21.85 |