Optimal Identifying Codes in Cycles and Paths

被引：12
|
作者：
Junnila, Ville [1 ]
Laihonen, Tero [1 ]
机构：
[1] Univ Turku, Dept Math, TUCS, Turku 20014, Finland
来源：
GRAPHS AND COMBINATORICS | 2012年 / 28卷 / 04期
基金：
芬兰科学院;
关键词：
Identifying code; Optimal code; Cycle; Path;
D O I：
10.1007/s00373-011-1058-6
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The concept of identifying codes in a graph was introduced by Karpovsky et al. (in IEEE Trans Inf Theory 44(2):599-611, 1998). These codes have been studied in several types of graphs such as hypercubes, trees, the square grid, the triangular grid, cycles and paths. In this paper, we determine the optimal cardinalities of identifying codes in cycles and paths in the remaining open cases.
引用
收藏
页码：469 / 481
页数：13
相关论文
共 50 条
12345