完全二部图K_(1,n)、K_(2,n)、K_(3,n)的点被多重集可区别的E-全染色  

E-total colorings of complete bipartite graphs K_(1,n),K_(2,n)and K_(3,n)which are vertex-distinguished by multiple sets

作　　者：郭亚勤 陈祥恩 GUO Yaqin;CHEN Xiang'en(College of Mathematics and Statistics,Northwest Normal University,Lanzhou 730070,Gansu,China)

机构地区：[1]西北师范大学数学与统计学院,甘肃兰州730070

出　　处：《山东大学学报(理学版)》2025年第2期24-33,40,共11页Journal of Shandong University(Natural Science)

摘　　要：利用反证法和色集合事先分配法,探讨了完全二部图K_(1,n)、K_(2,n)和K_(3,n)的点被多重集可区别的E-全染色,确定了以上图的点被多重集可区别的E-全色数。The E-total colorings of complete bipartite graphs K_(1,n),K_(2,n)and K_(3,n)which vertex-distinguished by multiple sets are discussed by using the method of proof by contradiction and the pre-assignment of chromatic sets,the vertex-distinguishing E-total chromatic numbers of these graphs are determined.

关 键 词：色集合 完全二部图 多重集 E-全染色 E-全色数 

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