关于K-tn的点可区别正常边染色

摘要

An edge-coloring is called vertex-distinguishing if every two distinct vertices are incident to different set of colored edges. Suppose K-tn denote the graph obtained from complete graph Kn by deleting a t-matching. The vertex-distinguishing proper edge-colorings on K-tn are discussed in this paper.%一个图的边染色称为是点可区别的,如果任意两个不同的顶点的关联边的颜色的集合不同. 设K-tn表示从n阶完全图中删去t条彼此不相邻的边后所得到的图. 本文对K-tn的点可区别正常边染色进行了讨论.