Adjacent vertex-distinguishing E-total coloring on the multiple join graph of several kinds of particular graphs

摘要

Let G(V,E) be a simple graph,k be a positive integer,f be a mapping from V(G) U E(G) to {1,2,…,k} If Vuv ∈ E(G),we have f(u) ≠ f(v),f (u) ≠ f (uv),f (v) ≠ f (uv),C(u) ≠ C(v),where C(u) ={ f(u)} U{ f (uv) | uv ∈ E(G)}.Then f is called the adjacent vertex-distinguishing E-total coloring of G.The number Xeal(G)=min{k|Ghasak-AVDETC} 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.