欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
图G的正常边染色称为是点可区别的,如果对G的任意两个不同的顶点u,v,与u关联的边的颜色构成的集合异于与v关联的边的颜色构成的集合。对图G进行点可区别正常边染色所需要的最少颜色数称为是G的点可区别正常边色数,记为χ＇s（G）。讨论了图K3,3∨Kt的点可区别正常边染色。
英文摘要：
A k-proper edge coloring of a simple graph G is called vertex-distinguishing if for two arbitrarily different vertices u and v,the set of colors assigned to the edges incident to u differs from the set of colors assigned to the edges incident to v.The minimum number of colors required for a vertex-distinguishing proper edge-coloring of a simple graph G is called the vertex-distinguishing proper edge chromatic number of G and denoted by χ′s（G）.Vertex-distinguishing proper edge colorings of K3,3∨Kt are discussed.
同期刊论文项目
同项目期刊论文
期刊信息
位置：