完全多部图的点被多重集可区别的IE-全染色  

Vertex Distinguishing IE-Total Coloringof Complete Multipartite Graphs byMultisets

作　　者：王勇军 

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

出　　处：《理论数学》2023年第4期942-947,共6页Pure Mathematics

摘　　要：利用反证法,构造染色法,色集合事先分配法,讨论了完全t部图的顶点被多重集可区别的IE-全染色。 给出了最优染色的一个方案,并确定了相应染色的色数。 完全解决了完全多部图的点被多重集可区别的IE-全染色的问题。In this paper, by using the method of contradiction, the method of constructing concrete coloring and the method of distributing the color sets in advance, we discuss the IE-total colorings of complete t-partite graph which are vertex-distinguished bymultisets. The methods of the corresponding optimal coloring are given and the chromatic numbers of the corresponding colorings are obtained. The question of vertex distinguishing IE-total coloring of complete multipartite graphs by multisets has be completely settled.

关 键 词：完全t部图 IE-全染色 多重集 色集合 可区别 

分 类 号：O15[理学—数学]