对简单图G(V,E),f是从V(G)∪E(G)到{1,2,…,k)的映射,k是自然数,若/满足(1)任意uv∈E(G),u≠v,f(u)≠f(v);(2)任意uv,uw∈E(G),v≠w,f(uv)≠f(uw);则称/是G的第一类弱全染色。给出了若干联图的第一类弱全色数。
Let G be a simple graph, k is a positive integer./is a mapping from V (G) ∪ E (G) to {1,2,…, k } such that: (1)arbitary uv ∈ E(G),u ≠ v,f(u)≠ f(v);, (2)arbitary uv,uw ∈ E(G),v ≠ w,f(uv)≠ f(uw), wesaythat/is the first kind weak total coloring of G. The minimal number of k is called the first kind weak total chromatic number of G, In this paper, we discuss the the first kind weak total chromatic number of some adjacent graoh.