Can I read Identifying Codes of Cycles on EtoBox?

Identifying Codes of Cycles by Sylvain Gravier; Julien Moncel; Ahmed Semri is a Mathematics article available to read on EtoBox.

What is Identifying Codes of Cycles about?

In this paper we deal with identifying codes in cycles. We show that for all r ≥ 1, any r -identifying code of the cycle C n has cardinality at least gcd(2r + 1, n) n 2 gcd(2r+1,n) . This lower bound is enough to solve the case n even (which was already solved in [N. Bertrand, I. Charon, O. Hudry, A. Lobstein, Identifying and locating-dominating codes on chains and cycles, European Journal of Combinatorics 25 (7) (2004) 969-987]), but the case n odd seems to be more complicated. An upper bound is given for the case n odd, and some special cases are solved. Furthermore, we give some conditions on n and r to attain the lower bound.

Who reads Identifying Codes of Cycles?

Author

Sylvain Gravier; Julien Moncel; Ahmed Semri

Publisher

Elsevier Science; Elsevier ; Elsevier Inc.; Elsevier BV (ISSN 0195-6698)

Published

2006

Language

EN

Field

Mathematics (Physical Sciences)