Identifying codes of cycles with odd orders

The problem of the r-identifying code of a cycle Cn has been solved totally when n is even. Recently, S. Gravier et al. give the r-identifying code for the cycle Cn with the minimum cardinality for odd n, when

• Type: Journal
• Year: 2008
• Where: EJC
• Authors: Min Xu, Krishnaiyan Thulasiraman, Xiao-Dong Hu
• Keywords: Cycle Cn, EJC 2007, EJC 2008, Gravier Et Al, Information Technology, R-identifying Code