On graph coloring check-digit method

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We 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.
7 pages, paper sumitted to Applied Mathematics Letters (Elsevier)

Keywords

Combinatorics, Cryptography and Security, Discrete Mathematics, Data Structures and Algorithms, D.4.6; E.4

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/65727

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0211317
 http://arxiv.org/abs/math/0211317

Collections

arXiv