论文标题
图形着色作为网络漏洞的度量
Graph Coloring as a Measure of Network Vulnerability
论文作者
论文摘要
我们考虑与图形着色有关的条件网络漏洞的新参数。如果色度数（或索引）大于某些指定的值k，我们将网络定义为正在运行。感兴趣的参数，最小k-色数和最小k奇异索引考虑网络中最少的故障，这可能使网络无法运行。在本文中，我们考虑边缘故障，顶点故障以及路径，周期和完整图的混合故障。
We consider new parameters for conditional network vulnerability related to graph coloring. We define a network to be in operation if the chromatic number (or index) is greater than some specified value k. The parameters of interest, the minimum k- chromatic number and the minimum k-chromatic index consider the least number of failures in the network which could render the network inoperable. In this paper, we consider edge failure, vertex failures, as well as mixed failures for paths, cycles, and complete graphs.
