图的多色以确保秘密
Multicoloring of Graphs to Secure a Secret
摘要:
图的点染色和多色是图论中的一个重要课题,也是其应用的一个重要方面。在顶点多色中,每个顶点被分配给给定颜色集合的某个子集。在这里,我们提出了一种新的顶点多色,动机的情况下,共享一个秘密,并确保它从一些攻击者的行动。我们将这种多色命名为高度抗$a$的顶点$k$ -multicoloring,其中$a$是攻击者的数量,$k$是颜色的数量。对于小的值$a$,我们确定什么是最小数量的顶点的图必须允许这样的着色,什么是最小数量的颜色需要。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。