论文标题
签名图的连接的色数
The Chromatic Number of Joins of Signed Graphs
论文作者
论文摘要
我们介绍了签名图的连接，并探索了全阳性和全负连接的色数。我们证明了与定理的类似物，两个图的连接的色数等于它们的色数的总和。给定两个签名的图，全阳性和全负的连接的色数通常小于其色数的总和，这取决于签名式涂片颜色的新概念的数量。
We introduce joins of signed graphs and explore the chromatic number of the all-positive and all-negative joins. We prove an analogue to the theorem that the chromatic number of the join of two graphs equals the sum of their chromatic numbers. Given two signed graphs, the chromatic number of the all-positive and all-negative join is usually less than the sum of their chromatic numbers, by an amount that depends on the new concept of deficiency of a signed-graph coloration.
