E-Total Coloring of Complete Bipartite Graphs K_(5,n)(5≤n≤7 113)Which Are Vertex-Distinguished by Multiple Sets  

完全二部图K_(5,n)(5≤n≤7113)的点被多重集可区别的E-全染色

作　　者：GUO Yaqin CHEN Xiang'en 郭亚勤;陈祥恩(西北师范大学数学与统计学院,中国兰州730070)

机构地区：[1]College of Mathematics and Statistics,Northwest Normal University,Lanzhou 730070,Gansu,China

出　　处：《Wuhan University Journal of Natural Sciences》2024年第5期412-418,共7页武汉大学学报（自然科学英文版）

基　　金：Supported by the National Natural Science Foundation of China (11761064)。

摘　　要：In this study,using the method of contradiction and the pre-assignment of chromatic sets,we discuss the E-total coloring of complete bipartite graphs K_(5,n)(5≤n≤7 113) which are vertex-distinguished by multiple sets.The vertex-distinguishing E-total chromatic numbers of this kind of graph are determined.本文利用反证法和色集合事先分配法,探讨了完全二部图K_(5,n)(5≤n≤7 113)的点被多重集可区别的E-全染色,确定了这类图的点被多重集可区别的E-全色数。

关 键 词：complete bipartite graph E-total coloring E-total chromatic number multiple sets chromatic sets 

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