摘要
一个图的边染色称为是点可区别的 ,如果任意两个不同的顶点的关联边的颜色的集合不同 .设K-tn 表示从 n阶完全图中删去 t条彼此不相邻的边后所得到的图 .本文对 K-tn 的点可区别正常边染色进行了讨论 .
An edge-coloring is called vertex-distinguishing if every two distinct vertices are incident to different set of colored edges. Suppose K -t n denote the graph obtained from complete graph K n by deleting a t-matching. The vertex-distinguishing proper edge-colorings on K -t n are discussed in this paper.
出处
《数学研究》
CSCD
2004年第4期376-380,共5页
Journal of Mathematical Study
基金
ThisworkwassupportedbytheYouthTeacherFoundationofNorthwestNormalUni-versity(NWN-QN-2003-22)
关键词
染色
边染色
点可区别正常边染色
coloring
edge-coloring
vertex-distinguishing proper edge-coloring