A1 Refereed original research article in a scientific journal
Optimal Identifying Codes in Cycles and Paths
Authors: Junnila V, Laihonen T
Publisher: SPRINGER TOKYO
Publication year: 2012
Journal: Graphs and Combinatorics
Journal name in source: GRAPHS AND COMBINATORICS
Journal acronym: GRAPH COMBINATOR
Number in series: 4
Volume: 28
Issue: 4
First page : 469
Last page: 481
Number of pages: 13
ISSN: 0911-0119
DOI: https://doi.org/10.1007/s00373-011-1058-6
Self-archived copy’s web address: https://research.utu.fi/converis/portal/detail/Publication/2680484
Abstract
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.
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.
Downloadable publication This is an electronic reprint of the original article. |  |
UTU Research Portal