An optimal locating-dominating set in the infinite triangular grid (Q2433724): Difference between revisions
From MaRDI portal
Latest revision as of 22:26, 24 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An optimal locating-dominating set in the infinite triangular grid |
scientific article |
Statements
An optimal locating-dominating set in the infinite triangular grid (English)
0 references
30 October 2006
0 references
If \(G=(V,E)\) is a graph, \(U\) a subset of the vertex set \(V\) and \(v \in V\) an arbitrary vertex of \(G\), then the set of all elements \(u\) of \(U\) with distance \(d(u,v) \leq 1\) is denoted by \(I(v)\). If all sets \(I(v)\) for \(v \in V \setminus U\) are non-empty and pairwise different, then \(U\) is called a locating-dominating set. It is proved in this paper that the smallest possible density of a locating-dominating set in the infinite triangular grid is \(\frac{13}{57}\).
0 references
graph
0 references
locating-dominating set
0 references
triangular grid
0 references
density
0 references
0 references