摘要
图G的正常[k]-边染色σ是指颜色集合为[k]={1,2,…,k}的G的一个正常边染色。用wσ(x)表示顶点x关联边的颜色之和,即wσ(x)=∑x∈eσ(e),并称wσ(x)为x关于σ的权。图G的k-邻和可区别边染色是指相邻顶点具有不同权的正常[k]-边染色,最小的k值称为G的邻和可区别边色数,记为χ′∑(G)。本文给出了两条不同阶路的联的邻和可区别边色数的精确值。另外,得到了同阶路的邻和可区别边色数的上界。
A proper[k]-edge coloringσof a graph G is a k-proper-edge-coloring of G using colors in[k]={1,2,…,k},let wσ(x)denote the sum of the colors of edges incident with x,i.e.,wσ(x)=∑x∈eσ(e),and wσ(x)is called the weight of the vertex x with respect toσ.A neighbor sum distinguishing edge coloringσof G is a proper[k]-edge coloring of G such that no pair adjacent vertices receive the same weight.The smallest value k for which G has such a coloring is called the neighbor sum distinguishing edge chromatic number of G and denoted byχ′∑(G).The exact values of the neighbor sum distinguishing edge chromatic number of the join of two paths with different orders are given.The upper bound of the neighbor sum distinguishing edge chromatic number of the join of two paths with same orders is obtained.
作者
田双亮
杨环
杨青
索郎王青
TIAN Shuang-liang;YANG Huan;YANG Qing;SUOLANG Wang-qing(School of Mathematics and Computer Science,Northwest Minzu University,Lanzhou 730030,Gansu,China;Key Laboratory of Streaming Data Computing Technologies and Applications,Northwest Minzu University,Lanzhou 730030,Gansu,China)
出处
《山东大学学报（理学版）》
CAS
CSCD
北大核心
2020年第9期29-35,共7页
Journal of Shandong University(Natural Science)
基金
西北民族大学科研创新团队计划资助
国家民委科研资助项目(14XBZ018)。
关键词
路
联
邻和可区别边染色
邻和可区别边色数
path
join
neighbor sum distinguishing edge coloring
neighbor sum distinguishing edge chromatic number
