CAJ | 학술논문

设σ是简单图G的k-点可区别边染色，Ei表示染颜色i的边所构成的集合，其中i=1,2，…，k.若对任意i，j=1，2，…，k，G中没有双色圈且陋｜｜Ei｜-｜Ej｜｜≤1，则称σ是G的k-点可区别均匀无圈边染色.最小的k值称为G的点可区别均匀无圈边色数．文章讨论了最大度为2的图MycieIski图的点可区别均匀无圈边染色，并得到了相应的色数值．
설σ시간단도G적k-점가구별변염색，Ei표시염안색i적변소구성적집합，기중i=1,2，…，k.약대임의i，j=1，2，…，k，G중몰유쌍색권차루｜｜Ei｜-｜Ej｜｜≤1，칙칭σ시G적k-점가구별균균무권변염색.최소적k치칭위G적점가구별균균무권변색수．문장토론료최대도위2적도MycieIski도적점가구별균균무권변염색，병득도료상응적색수치．
A vertex-distinguishing edge coloring o of a simple graph G is called vertex disti- nguishing equitable acyclic edge-coloring, if there are no bichromatic cycles in G, and|| Ei| - |Ej ||≤1, which Ei is edge sets with i color, then i = 1,2,…, k. The smallest number k of colors is called the vertex-distinguishing equitable acyclic chromatic index of G. In this paper, the vertex-distinguishing equitable acyclic edge-coloring of the Mycielski' graphs of some graphs with △(G) = 2 are studied and obtained the exact values.