Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi

Multicoloring of graphs to secure a secret (CROSBI ID 258147)

Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija

Vojković, Tanja ; Vukičević Damir ; Zlatić Vinko Multicoloring of graphs to secure a secret // Rad Hrvatske akademije znanosti i umjetnosti. Razred za matematičke, fizičke i kemijske znanosti. Matematičke znanosti, 22 (2018), 534; 1-22. doi: 10.21857/m3v76t6jky

Podaci o odgovornosti

Vojković, Tanja ; Vukičević Damir ; Zlatić Vinko

engleski

Multicoloring of graphs to secure a secret

Vertex coloring and multicoloring of graphs are a well known subject in graph theory, as well as their applications. In vertex multicoloring, each vertex is assigned some subset of a given set of colors. Here we propose a new kind of vertex multicoloring, motivated by the situation of sharing a secret and securing it from the actions of some number of attackers. We name the multicoloring a highly a-resistant vertex k-multicoloring, where a is the number of the attackers, and k the number of colors. For small values a we determine what is the minimal number of vertices a graph must have in order to allow such a coloring, and what is the minimal number of colors needed.

Graph theory ; graph coloring ; multicoloring ; secret sharing

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o izdanju

22 (534)

2018.

1-22

objavljeno

1845-4100

1849-2215

10.21857/m3v76t6jky

Povezanost rada

Matematika

Poveznice
Indeksiranost