On graph coloring check-digit method

Simple item page
dc.creatorKulesza, Kamil
dc.creatorKotulski, Zbigniew
dc.date2002-11-20
dc.date.accessioned2026-07-07T04:53:07Z
dc.date.available2026-07-07T04:53:07Z
dc.descriptionWe show a method how to convert any graph into the binary number and vice versa. We derive upper bound for maximum number of graphs, that, have fixed number of vertices and can be colored with n colors (n is any given number). Proof for the result is outlined. Next, graph coloring based check-digit scheme is proposed. We use quantitative result derived, to show, that feasibility of the proposed scheme increases with size of the number which digits are checked, and overall probability of digits errors.
dc.description7 pages, paper sumitted to Applied Mathematics Letters (Elsevier)
dc.identifierhttps://arxiv.org/abs/math/0211317
dc.identifierhttp://arxiv.org/abs/math/0211317
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/65727
dc.subjectCombinatorics
dc.subjectCryptography and Security
dc.subjectDiscrete Mathematics
dc.subjectData Structures and Algorithms
dc.subjectD.4.6; E.4
dc.titleOn graph coloring check-digit method
dc.typetext

Files

Collections

arXiv