Abstract
In any connected, undirected graph G = (V, E), the distance d(x, y) between two vertices x and y of G is the minimum number of edges in a path linking x to y in G. A sphere in G is a set of the form S r (x) = {y ∈ V : d(x, y) = r}, where x is a vertex and r is a nonnegative integer called the radius of the sphere. We first address in this paper the following question: What is the minimum number of spheres with fixed radius r ≥ 0 required to cover all the vertices of a finite, connected, undirected graph G? We then turn our attention to the Hamming Hypercube of dimension n, and we show that the minimum number of spheres with any radii required to cover this graph is either n or n + 1, depending on the parity of n. We also relate the two above problems to other questions in combinatorics, in particular to identifying codes.
Similar content being viewed by others
References
Alon N., Bergmann E., Coppersmith D., Odlyzko A.: Balancing sets of vectors. IEEE Trans. Inf. Theory 34(1), 128–130 (1988)
Cohen G., Honkala I., Litsyn S., Lobstein A.: Covering codes. Elsevier, Amsterdam (1997)
Exoo G., Junnila V., Laihonen T., Ranto S.: Upper bounds for binary identifying codes. Adv. Appl. Math. 42, 277–289 (2009)
Hersh P.: On exact n-step domination. Discret. Math. 205, 235–239 (1999)
Honkala I., Lobstein A.: On identifying codes in binary Hamming spaces. J. Comb. Theory Ser. A 99, 232–243 (2002)
Karpovsky M.G., Chakrabarty K., Levitin L.B.: On a new class of codes for identifying vertices in graphs. IEEE Trans. Inf. Theory 44(2), 599–611 (1998)
Author information
Authors and Affiliations
Corresponding author
Additional information
This is one of several papers published in Designs, Codes and Cryptography comprising the “Special Issue on Coding Theory and Applications”.
Rights and permissions
About this article
Cite this article
Auger, D., Cohen, G. & Mesnager, S. Sphere coverings and identifying codes. Des. Codes Cryptogr. 70, 3–7 (2014). https://doi.org/10.1007/s10623-012-9638-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-012-9638-x