论文标题
循环图的最佳相邻顶点呈固定的边缘色
Optimal Adjacent Vertex-Distinguishing Edge-Colorings of Circulant Graphs
论文作者
论文摘要
图G的A $ K $ - 螺旋桨边彩色称为相邻顶点 - 如果有两个相邻的顶点是通过在每个顶点的边缘中出现的颜色集来区分的。 $ g $承认这种着色的最小值$ k $由$χ'_a（g）$表示。我们证明，大多数循环图$ c_n（[1，r]）$的$χ'_a（g）= 2R + 1 $。
A $k$-proper edge-coloring of a graph G is called adjacent vertex-distinguishing if any two adjacent vertices are distinguished by the set of colors appearing in the edges incident to each vertex. The smallest value $k$ for which $G$ admits such coloring is denoted by $χ'_a(G)$. We prove that $χ'_a(G) = 2R + 1$ for most circulant graphs $C_n([1, R])$.
