钻石项链图Nk的点被多重集可区别的E-全染色(2 ≤ k ≤ 165)
E-Total Coloring of Nk Which Is Vertex-Distinguished by Multiple Sets (2 ≤ k ≤ 165)
摘要: 利用反证法和构造具体染色的方法，讨论了钻石项链图Nk的顶点被多重集可区别的E-全染色。给出了钻石项链图Nk的相应染色方案，构造了具体的钻石项链图Nk的点被多重集可区别的E-全染色，其中2 ≤ k ≤ 165。
Abstract:
In this paper, by using the method of contradiction and the method of constructing concrete col-oring, we discuss E-total coloring of Nk which is vertex-distinguished by multiple sets. The corre-sponding colorings of Nk are presented, and the E-total chromatic numbers of vertex-distinguished Nk with multiple sets are obtained, which 2 ≤ k ≤ 165.
参考文献
|
[1]
|
Burris, A.C. and Schelp, R.H. (1997) Vertex-Distinguishing Proper Edge-Coloring. Journal Graph Theory, 26, 73-82. [Google Scholar] [CrossRef]
|
|
[2]
|
杨芳, 王治文, 陈祥恩, 马春燕. 完全图和星的合成的点可区别正常边染色[J]. 华东师范大学学报(自然科学版), 2013(5): 136-143.
|
|
[3]
|
Michael, A. (2018) Henning and Pawaton Kaemawichanurat. Semipaired Domination in Claw-Free Cubic Graphs. Graphs and Combinatorics, 34, 819-844. [Google Scholar] [CrossRef]
|
|
[4]
|
Yannakakis, M. and Gavril, F. (1980) Edge Dominating Sets in Graphs. SIAM Journal on Applied Mathematics, 38, 364-372. [Google Scholar] [CrossRef]
|
|
[5]
|
Michael, A. (2012) Henning and Christian Löwenstein. Locating-Total Domination in Claw-Free Cubic Graphs. Discrete Mathematics, 312, 3107-3116. [Google Scholar] [CrossRef]
|
|
[6]
|
Zhang, Z.F., Qiu, P.X., Xu, B.G., et al. (2008) Vertex-Distinguishing Total Coloring of Graphs. Ars Combinatoria, 87, 33-45.
|
|
[7]
|
Chen, X.E., Gao, Y.P. and Yao, B. (2013) Vertex-Distinguishing IE-Total Colorings of Complete Bipartite Graphs (mGoogle Scholar] [CrossRef]
|
|
[8]
|
寇艳芳, 陈祥恩, 王治文. 和 的点可区别的IE-全染色及一般全染色[J]. 山东大学学报(理学版), 2018, 53(8): 53-60.
|
|
[9]
|
陈祥恩, 马静静. 的点可区别的IE-全染色(p ≥ 1008) [J]. 电子与信息学报, 2020, 42(12): 3068-3073.
|
|
[10]
|
闫瑞敏, 陈祥恩. 的点可区别的IE-全染色(p ≥ 2028) [J]. 华东师范大学学报(自然科学版), 2022(2): 16-23.
|