摘要
图G的一个k-正常边染色,若满足任意两个相邻点的色集合中所有元素之和不同,则称该染色为图G的一个k-邻和可区别边染色。其中,k的最小值称为图G的邻和可区别边色数。运用分析法与数学归纳法,研究了单圈图的邻和可区别边色数。
A proper k-edge coloring of graph G is a k-neighbor sum distinguishing edge coloring if the sum of all elements in the colors sets of any two adjacent vertices is different. The smallest value k is called the neighbor sum distinguishing edge chromatic number of G. The neighbor sum distinguishing edge chromatic numbers of unicyclic graphs are studied by the methods of analysis and mathematical induction.
作者
谭钧铭
强会英
王洪申
TAN Jun-ming;QIANG Hui-ying;WANG Hong-shen(College of Mathematics and Physics,Lanzhou Jiaotong University,Lanzhou 730070,Gansu,China;School of Mechanical and Electrical Engineering,Lanzhou University of Technology,Lanzhou 730050,Gansu,China)
出处
《山东大学学报（理学版）》
CAS
CSCD
北大核心
2022年第2期78-83,91,共7页
Journal of Shandong University(Natural Science)
基金
国家自然科学基金资助项目(61962035,11961041)。
关键词
单圈图
邻和可区别边染色
邻和可区别边色数
unicyclic graph
neighbor sum distinguishing edge coloring
neighbor sum distinguishing edge chromatic number
