Year-end Sale % OFF 
Abstract
In this paper we deal with identifying codes in cycles. We show that for all r≥1, any r-identifying code of the cycle Cn has cardinality at least gcd(2r+1,n)⌈n2gcd(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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
