Identifying codes of cycles with odd orders

Authors:
Min Xu;Krishnaiyan Thulasiraman;Xiao-Dong Hu
Affiliations:
School of Mathematical Sciences, Beijing Normal University, Laboratory of Mathematics and Complex Systems, Ministry of Education, Beijing, 100875, China and School of Computer Science, University ...;School of Computer Science, University of Oklahoma, Norman, Oklahoma, 73019, USA;Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing, 100080, China
Venue:
European Journal of Combinatorics
Year:
2008

Citing 6
Cited 4

Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard

Theoretical Computer Science
Identifying codes in some subgraphs of the square lattice

Theoretical Computer Science - Combinatorics of the discrete plane and tilings
Identifying and locating-dominating codes on chains and cycles

European Journal of Combinatorics
Identifying codes of cycles

European Journal of Combinatorics
Locating sensors in paths and cycles: The case of 2-identifying codes

European Journal of Combinatorics
On a new class of codes for identifying vertices in graphs

IEEE Transactions on Information Theory

Identifying codes and locating-dominating sets on paths and cycles

Discrete Applied Mathematics
Locating and identifying codes in circulant networks

Discrete Applied Mathematics
New results on variants of covering codes in Sierpiński graphs

Designs, Codes and Cryptography
Identifying codes of the direct product of two cliques

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of the r-identifying code of a cycle C"n has been solved totally when n is even. Recently, S. Gravier et al. give the r-identifying code for the cycle C"n with the minimum cardinality for odd n, when n=3r+2 and gcd(2r+1,n)1. In this paper, we deal with the r-identifying code of the cycle C"n for odd n, when n=3r+2 and gcd(2r+1,n)=1.