轮与扇的点被多重集可区别的E-全染色  

E-total coloring of wheels and fans vertex-distinguished by multiple sets

作　　者：曹静 陈祥恩 CAO Jing;CHEN Xiang'en(College of Mathematics and Statistics,Northwest Normal University,Lanzhou 730070,Gansu,China)

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

出　　处：《山东大学学报（理学版）》2024年第2期38-46,共9页Journal of Shandong University(Natural Science)

基　　金：国家自然科学基金资助项目(11761064)。

摘　　要：利用反证法和构造具体染色的方法证明轮与扇存在顶点被多重集可区别的E-全染色,其次给出具体的轮与扇的顶点被多重集可区别的E-全染色方案,最后构造了轮的点被多重集可区别的E-全染色算法。By using the method of contradiction and the method of constructing concrete coloring,we discuss E-total coloring of wheels and fans which are vertex-distinguished by multiple sets.The methods of the corresponding colorings of wheels and fans are obtained,and the E-total coloring algorithm of wheels which are vertex-distinguished by multiple sets are constructed.

关 键 词：轮 扇 多重集 E-全染色 E-全色数 

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