欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
如果图G的一个正常边染色满足任意两个不同点的关联边色集不同，则称为点可区别边染色（VDEC），其所用最少颜色数称为点可区别边色数．利用构造法给出了积图点可区别边染色的一个结论，得到了关于积图点可区别边色数的若干结果，并且给出25个具体积图的点可区别边色数，验证了它们满足点可区别边染色猜想（VDECC）．
英文摘要：
A proper edge coloring of graph G is called vertex-distinguishing if the set of colors meets to vertex u differs from the set of colors meets to vertex v for any two distinct vertices u and v. The minimum number k for which there exists vertex distinguishing proper edge coloring using k colors is called the vertex distinguishing proper edge chromatic number. In this paper, we will obtain a conclusion of vertex-distinguishing edge coloring of product graph by using the method of construction, and get some results of the vertex-distinguishing edge chromatic numbers of product graphs, then obtain vertex-distinguishing edge chromatic numbers of 25 product graphs, which satisfy the conjecture on VDECC.
同期刊论文项目
同项目期刊论文
期刊信息
位置：