Optimal Identifying Codes in Cycles and Paths

Tietueen suppeat tiedot
dc.contributor.authorJunnila V
dc.contributor.authorLaihonen T
dc.contributor.organizationfi=matematiikka|en=Mathematics|
dc.contributor.organization-code1.2.246.10.2458963.20.41687507875
dc.converis.publication-id2680484
dc.converis.urlhttps://research.utu.fi/converis/portal/Publication/2680484
dc.date.accessioned2022-10-28T14:06:18Z
dc.date.available2022-10-28T14:06:18Z
dc.description.abstractThe 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.
dc.format.pagerange469
dc.format.pagerange481
dc.identifier.jour-issn0911-0119
dc.identifier.olddbid186285
dc.identifier.oldhandle10024/169379
dc.identifier.urihttps://www.utupub.fi/handle/11111/36488
dc.identifier.urnURN:NBN:fi-fe2021042714786
dc.language.isoen
dc.okm.affiliatedauthorJunnila, Ville
dc.okm.affiliatedauthorLaihonen, Tero
dc.okm.discipline111 Mathematicsen_GB
dc.okm.discipline111 Matematiikkafi_FI
dc.okm.internationalcopublicationnot an international co-publication
dc.okm.internationalityInternational publication
dc.okm.typeA1 ScientificArticle
dc.publisherSPRINGER TOKYO
dc.publisher.countryJapanen_GB
dc.publisher.countryJapanifi_FI
dc.publisher.country-codeJP
dc.relation.doi10.1007/s00373-011-1058-6
dc.relation.ispartofjournalGraphs and Combinatorics
dc.relation.issue4
dc.relation.volume28
dc.source.identifierhttps://www.utupub.fi/handle/10024/169379
dc.titleOptimal Identifying Codes in Cycles and Paths
dc.year.issued2012

Tiedostot

Näytetään 1 - 1 / 1
Name:
IDonCyclesPathsGCRevision0511.pdf
Size:
191.16 KB
Format:
Adobe Portable Document Format
Description:
Final draft
Lataa

Kokoelmat

Rinnakkaistallenteet