作者:何玉萍; 陈祥恩theunionofgraphspropertotalcoloringchromaticnumber
摘要:Let G be a simple graph and f be a proper total coloring(or a total coloring in brief) of G. For any vertex u in G, Cf(u) denote the set of colors of vertex u and edges which incident with vertex u. Cf(u) is said to be the color set of vertex u under f. If Cf(u) = Cf(v)for any two distinct vertices u and v of G, then f is called vertex-distinguishing total coloring of G(in brief VDTC), a vertex distinguishing total coloring using k colors is called k-vertexdistinguishing total coloring of G(in brief k-VDTC). The minimum number k for which there exists a k-vertex-distinguishing total coloring of G is called the vertex-distinguishing total chromatic number of G, denoted by χvt(G). By the method of prior distributing the color sets, we obtain vertex-distinguishing total chromatic number of m C9 in this paper.
注:因版权方要求,不能公开全文,如需全文,请咨询杂志社