JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE) ›› 2025, Vol. 60 ›› Issue (2): 24-33.doi: 10.6040/j.issn.1671-9352.0.2023.352

Previous Articles    

E-total colorings of complete bipartite graphs K1,n, K2,n and K3,n which are vertex-distinguished by multiple sets

GUO Yaqin, CHEN Xiangen*   

  1. College of Mathematics and Statistics, Northwest Normal University, Lanzhou 730070, Gansu, China
  • Published:2025-02-14

PDF (PC)

4

Abstract: The E-total colorings of complete bipartite graphs K1,n, K2,n and K3,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.

Key words: chromatic set, complete bipartite graph, multiple set, E-total coloring, E-total chromatic number

CLC Number: 

  • O157.5
[1] HARARY F, PLANTHOLT M. The point-distinguishing chromatic index[M]. New York: Wiley Interscience, 1985.
[2] BURRIS A C, SCHELP R H. Vertex-distinguishing proper edge-coloring[J]. Journal of Graph Theory, 1997, 26(2):73-82.
[3] BALISTER P N, RIORDAN O M, SCHELP R H. Vertex-distinguishing edge colorings of graphs[J]. Journal of Graph Theory, 2003, 42(2):95-109.
[4] ZHANG Z F, QIU P X, LI J W, et al. Vertex-distinguishing total colorings of graphs[J]. Ars Combinatoria, 2008, 87:33-45.
[5] CHEN X E, ZU Y, ZHANG Z F. Vertex-distinguishing E-total colorings of graphs[J]. Arabian Journal for Science and Engineering, 2011, 36(8):1485-1500.
[6] 李世玲,陈祥恩,王治文. 完全二部图K3,n(3≤n≤17)的点可区别E-全染色[J]. 吉林大学学报(理学版),2015,53(6):1171-1176. LI Shiling, CHEN Xiangen, WANG Zhiwen. Vertex-distinguish E-total coloring of complete bipartite graph K3,n with 3≤n≤17[J]. Journal of Jilin University(Science Edition), 2015, 53(6):1171-1176.
[7] 李世玲,陈祥恩,王治文. 完全二部图K3,n(n≥18)的点可区别E-全染色[J]. 山东大学学报(理学版),2016,51(4):68-71. LI Shiling, CHEN Xiangen, WANG Zhiwen. Vertex-distinguishing E-total coloring of complete bipartite graph K3,n with n≥18[J]. Journal of Shandong University(Natural Science), 2016, 51(4):68-71.
[8] 陈祥恩. 某些顶点对被非多重色集合所区别的未必正常染色的综述[J]. 广州大学学报(自然科学版),2019,18(4):50-59. CHEN Xiangen. A survey on not necessarily proper colorings under which certain pairs of vertices are distinguished by nonmultiple color sets[J]. Journal of Guangzhou University(Natural Science Edition), 2019, 18(4):50-59.
[9] 曹静,陈祥恩. 轮与扇的点被多重集可区别的E-全染色[J]. 山东大学学报(理学版),2024,59(2):38-46. CAO Jing, CHEN Xiangen. E-total coloring of wheels and fans which are vertex distinguished by multiple sets[J]. Journal of Shandong University(Natural Science), 2024, 59(2):38-46.
[10] 邵嘉裕. 组合数学[M]. 上海:同济大学出版社,1990. SHAO Jiayu. Combinatorial mathematics[M]. Shanghai: Tongji University Press, 1990.
[1] Kaiyang HU,Mingfang HUANG,Baolin MA. Vertex-distinguishing E-total coloring of complete bipartite graph K12, n for 12≤n≤88 [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2024, 59(6): 36-43, 70.
[2] Jing CAO,Xiang'en CHEN. E-total coloring of wheels and fans vertex-distinguished by multiple sets [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2024, 59(2): 38-46.
[3] SUO Meng-ge, CHEN Jing-rong, ZHANG Juan-min. k-Path vertex cover in Cartesian product graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2022, 57(12): 103-110.
[4] . Vertex-distinguishing IE-total coloring and general-total coloring of K1,3,p and K1,4,p [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2018, 53(8): 53-60.
[5] . Vertex-distinguishing E-total coloring of complete bipartite graph K10,n with 10≤n≤90 [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2018, 53(12): 23-30.
[6] LI Shi-ling, CHEN Xiang-en, WANG Zhi-wen. Vertex-Distinguishing E-Total coloring of complete bipartite graph K3,n with n≥18 [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2016, 51(4): 68-71.
[7] LIU Xin-sheng, DENG Wei-dong, WANG Zhi-qiang. Several conclusions of adjacent vertex distinguishing E-total coloring of the cartesian product graphs [J]. JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE), 2015, 50(02): 5-8.
[8] LI Zhen-lin, LU Jun-long, L Xin-zhong. On signed edge total domination of graphs [J]. J4, 2012, 47(6): 83-86.
[9] WANG Guo-xing. Vertex distinguishing IE-total chromatic numbers of mC3 [J]. J4, 2011, 46(2): 57-61.
[10] . Vertex distinguishing IEtotal chromatic numbers of  complete bipartite graph K5,n [J]. J4, 2009, 44(2): 91-96.
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
Copyright 2018 © Editorial office of JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE)
Supported by Beijing Magtech Co.Ltd