Identifying codes with small radius in some infinite regular graphs

Authors Irène Charon, Olivier Hudry, Antoine Lobstein

Publication date 25 April 2002

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/121793, http://www.emis.de/journals/EJC/Volume_9/Abstracts/v9i1r11.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

\(r\)-identifying code infinite regular graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (including graph drawing) in computer science (68R10) Bounds on codes (94B65)

Review text

Summary: Let \(G=(V,E)\) be a connected undirected graph and \(S\) a subset of vertices. If for all vertices~\(v \in V\), the sets \(B_r(v) \cap S\) are all nonempty and different, where \(B_r(v)\) denotes the set of all points within distance~\(r\) from ~\(v\), then we call~\(S\) an \(r\)-identifying code. We give constructive upper bounds on the best possible density of \(r\)-identifying codes in four infinite regular graphs, for small values of~\(r\).

Recommendations

Cited in

(53)

This page was built for publication: Identifying codes with small radius in some infinite regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5960786)