子母图的D(β)-点和可区别边色数之间的关系  

The Relationship of D(β)-Vertex Sum Distinguishing Edge Chromatic Numbers Between Graphs and Sub-graphs

作　　者：强会英[1] 何静 王洪申[2] QIANG Huiying;HE Jing;WANG Hongshen(School of Mathematics and Physics,Lanzhou Jiaotong University,Lanzhou 730070,China;School of Mechanical and Electrical Engineering,Lanzhou University of Technology,Lanzhou 730050,China)

机构地区：[1]兰州交通大学数理学院,兰州730070 [2]兰州理工大学机电工程学院,兰州1730050

出　　处：《兰州交通大学学报》2025年第2期30-35,44,共7页Journal of Lanzhou Jiaotong University

基　　金：国家自然科学基金(61962035)。

摘　　要：运用构造染色法和组合分析法,研究了简单连通图G中任意两点之间的距离β不超过2时,其子图与母图G的D(β)-点和可区别边色数之间的大小关系。结果表明:图G的D(β)-点和可区别边色数不全都大于其子图的色数,存在子图的D(β)-点和可区别边色数大于母图色数的情形。Using the method of constructive coloring and combinatorial analysis,the relationship between the D(p)-vertex sum distinguishing edge chromatic numbers of a simple connected graph G and its sub-graphs is investigated where the distance between any two vertices in G does not exceed 2.The results show that not all the D(β)-vertex sum distinguishing edge chromatic number of graph are greater than those of its sub-graphs,and there exist cases where the D(β)-vertex sum distinguishing edge chromatic number of sub-graphs is greater than that of the graph G.

关 键 词：子图 D(β)-点和可区别边染色 D(β)-点和可区别边色数 

分 类 号：O157.5[理学—数学]