A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
Optimal Identifying Codes in Cycles and Paths
Tekijät: Junnila V, Laihonen T
Kustantaja: SPRINGER TOKYO
Julkaisuvuosi: 2012
Journal: Graphs and Combinatorics
Tietokannassa oleva lehden nimi: GRAPHS AND COMBINATORICS
Lehden akronyymi: GRAPH COMBINATOR
Numero sarjassa: 4
Vuosikerta: 28
Numero: 4
Aloitussivu: 469
Lopetussivu: 481
Sivujen määrä: 13
ISSN: 0911-0119
DOI: https://doi.org/10.1007/s00373-011-1058-6
Rinnakkaistallenteen osoite: https://research.utu.fi/converis/portal/detail/Publication/2680484
Tiivistelmä
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.
Ladattava julkaisu This is an electronic reprint of the original article. |  |
Turun yliopiston Tutkimustietojärjestelmän portaali