Back to Search
Start Over
An optimal locating-dominating set in the infinite triangular grid
- Source :
-
Discrete Mathematics . Nov2006, Vol. 306 Issue 21, p2670-2681. 12p. - Publication Year :
- 2006
-
Abstract
- Abstract: Assume that is an undirected graph, and . For every , we denote by the set of all elements of C that are within distance one from . If all the sets for are non-empty, and pairwise different, then C is called a locating-dominating set. The smallest possible density of a locating-dominating set in the infinite triangular grid is shown to be . [Copyright &y& Elsevier]
- Subjects :
- *GRAPH theory
*ALGEBRA
*COMBINATORICS
*TOPOLOGY
Subjects
Details
- Language :
- English
- ISSN :
- 0012365X
- Volume :
- 306
- Issue :
- 21
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 22593820
- Full Text :
- https://doi.org/10.1016/j.disc.2006.04.028