完全多部图的点被多重集可区别的IE-全染色
Vertex Distinguishing IE-Total Coloringof Complete Multipartite Graphs byMultisets
DOI: 10.12677/PM.2023.134099, PDF, HTML, 下载: 214  浏览: 322 
作者: 王勇军：西北师范大学，数学与统计学院，甘肃 兰州
关键词: 完全t部图；IE-全染色；多重集；色集合；可区别；Complete t-Partite Graph； IE-Total Coloring； Multiset； Color Set； Distinguishing
摘要: 利用反证法，构造染色法，色集合事先分配法，讨论了完全t部图的顶点被多重集可区别的IE-全染色。 给出了最优染色的一个方案，并确定了相应染色的色数。 完全解决了完全多部图的点被多重集可区别的IE-全染色的问题。
Abstract: 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 by multisets. 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.
文章引用：王勇军. 完全多部图的点被多重集可区别的IE-全染色[J]. 理论数学, 2023, 13(4): 942-947. https://doi.org/10.12677/PM.2023.134099

参考文献

[1] Harary, F. and Plantholt, M. (1985) The Point-Distinguishing Chromatic Index. In: Harary, F. and Maybee, J.S., Eds., Graphs and Application, Wiley Interscience, New York, 147-162.
[2] Liu, C.J. and Zhu, E.Q. (2014) General Vertex-Distinguishing Total Colorings of Graphs. Journal of Applied Mathematics, 2014, Article ID: 849748.
https://doi.org/10.1155/2014/849748
[3] Chen, X.E., Gao, Y.P. and Yao, B. (2013) Vertex-Distinguishing IE-Total Colorings of Complete Bipartite Graphs Km;n(m < n). Discussiones Mathematicae Graph Theory, 33, 289-306.
https://doi.org/10.7151/dmgt.1659
[4] 陈祥恩, 张爽, 李泽鹏. K2,4,p的点可区别IE-全染色[J]. 电子与信息学报, 2020, 42(12): 2999-3004.
[5] 马静静, 陈祥恩. K4,4,p的点可区别的IE-全染色(4 ≤ p ≤ 1007) [J]. 中山大学学报(自然科学版), 2020, 59(4): 134-143.
[6] 闰瑞敏, 陈祥恩. K5,5,p的点可区别的IE-全染色(p ≥ 2028) [J]. 华东师范大学学报(自然科学版), 2022(2): 16-23.
[7] 陈祥恩, 王勇军. 完全二部图的点被多重集可区别的IE-全染色及一般全染色[J]. 吉林大学学 报(理学版), 2022, 60(4): 838-844.
[8] 邵嘉裕. 组合数学[M]. 上海: 同济大学出版社, 1990.

为你推荐