General bounds for identifying codes in some infinite regular graphs (Q5954312)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1699537
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | General bounds for identifying codes in some infinite regular graphs |
scientific article; zbMATH DE number 1699537 |
Statements
General bounds for identifying codes in some infinite regular graphs (English)
0 references
7 February 2002
0 references
Summary: Consider a connected undirected graph \(G=(V,E)\) and a subset of vertices \(C\). If for all vertices \(v \in V\), the sets \(B_r(v) \cap C\) are all nonempty and pairwise distinct, where \(B_r(v)\) denotes the set of all points within distance \(r\) from \(v\), then we call \(C\) an \(r\)-identifying code. We give general lower and upper bounds on the best possible density of \(r\)-identifying codes in three infinite regular graphs.
0 references
\(r\)-identifying code
0 references
infinite regular graphs
0 references
0.9493190050125122
0 references
0.9020501375198364
0 references
0.8800908923149109
0 references
0.8798913955688477
0 references
0.8755714297294617
0 references
