Adjacent Vertex-Distinguishing E-Total Coloring on the Multiple Join Graph of Several Kinds of Particular Graphs

Abstract:

Let G(V,E) be a simple graph, k be a positive integer, f be a mapping from V(G)E(G) to 1,2,...k. If uvE(G), we have f(u)≠f(v),f(u)≠f(uv) ,f(v)≠f(uv) ,C(u)≠C(v) , where C(u). Then f is called the adjacent vertex-distinguishing E-total coloring of G. The number is called the adjacent vertex –distinguishing E-total chromatic number of G. In this paper, the adjacent vertex –distinguishing E-total chromatic number of the multiple join graph of several kinds of particular graphs is discussed by using construct coloring function.

• Periodical: Advanced Materials Research (Volumes 546-547)
• Pages: 489-494
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.546-547.489
• Online since: July 2012
• Authors: Mu Chun Li, Li Zhang
• Keywords: Adjacent Vertex-Distinguishing E-Total Coloring, Complete Graph, Fan, Multiple Join Graph, Wheel

References

[1] Bondy J A, Murty U S R. Graph Theory with Applications[M]. New York: The Macmillan Press LTD, (1976).

[2] Zhang Zhongfu, Chen Xiang'en, Li Jingwen, et al. On adjacent-vertex-distinguishing total coloring of graphs[J]. Science in China Ser. A, 2005, 48(3): 289-299.

DOI: 10.1360/03ys0207

[3] Jingwen Li. Several distinguishing coloring of graphs[R]. The conference of Chinas electronic circuits and systems branch to graph theory and system optimize professional committee in (2011).

[4] Liu Xingsheng , Chen Xiangen , Ou Lifeng , etc. A lower Bound on Cochromatic Number for Line Graphs of a Kind of Graphs[J]. Applied Mathematics A Journal of Chinese Universitive. 2006, 3: 316-322.

DOI: 10.1007/s11766-003-0013-6

[5] Muchun Li, Huiying Qiang, Fugang Cao, etc. On the adjacent-vertex-distinguishing total chromatic number and the adjacent-strong-dege chromatic number of general Mycielski graph of Km, n[J] . Mathematics Practice and Theory. 2008, 38(19): 147-152.

DOI: 10.11650/tjm/6499

[6] Muchun Li, Zhongfu Zhang. Adjacent vertex-distinguishing E-total coloring on a class of the multiple join graphs[J]. Pure and Applied Mathematics, 2010, (01): 36-41.

[7] Xiangen Chen, Zhongfu Zhang, etc. Adjacent-vertex-distinguishing total chromatic numbers on Pm∨Kn[J]. Math Res Exposition 2006, 26(3): 489-494.

[8] Muchun Li, Chao Hu, Zhongfu Zhang. Adjacent vertex-Odd Cycle, Even Cycle and Wheel[J]. Journal of Zhengzhou University: Natural Science Edition, 2009, (02): 1-6.