摘要
利用完全二部图K4,n及K5,n的点可区别IE-全色数的结论,探讨了完全二部图K4,n及K5,n的一般点可区别全染色以及它们的一般点可区别全色数.
With true help of existing research on the conclusions of vertex distinguishing IE-total colorings of complete bipartite graphs K4,nand K5,n,the general vertex-distinguishing total colorings of complete bipartite graphs K4,n and K5,n are discussed and their general vertex-distinguishing total chromatic numbers.
引文
[1] ZHANG Z F,QIU P X,XU B G,et al.Vertex distinguishing total coloring of graphs[J].Ars Combinaroria,2008,87:33-45.
[2]YANG F,CHEN X E,MA C Y.On the vertex-distinguishing proper total colorings of complete p-partite graphs with equipotent parts[J].Ars Combinaroria,2017,134:233-249.
[3] CHEN X E,GAO Y P,YAO B.Vertex-distinguishing IE-total colorings of complete bipartite graphs Km,n(m [4] CHEN X E,HE W Y,LI Z P,et al.Vertex-distinguishing IE-total colorings of cycles and wheels[J].Communications in Mathematical Research,2014,30(3):222-236.
[5] LIU C J,ZHU E Q.General vertex-distinguishing total colorings of graphs[J/OL].Journal of Applied Mathematics,2014[2017-09-16].http://dx.doi.org/10.1155/2014/849748.
[6]陈祥恩,苏丽,王治文.完全二部图K2,n及K3,n的一般点可区别全染色[J].吉林大学学报(理学版),2016,54(6):1289-1293.