K_m∨W_n及其子图的邻点可区别E-全染色  

Adjacent vertex distinguishing E-total coloring on K_m∨W_n and its subgraphs

作　　者：李步军[1] 

机构地区：[1]淮海工学院理学院,江苏连云港222005

出　　处：《兰州理工大学学报》2013年第3期170-172,共3页Journal of Lanzhou University of Technology

摘　　要：设图G(V,E)为简单图,k是一个正整数,f是V(G)∪E(G)到{1,2,…,k}的一个映射,如果uv∈E(G),有f(u)≠f(v),f(u)≠f(uv),f(v)≠f(uv),且当C(u)={f(u)}∪{f(uv)|uv∈E(G)}时,C(u)≠C(v),则称f是图G的邻点可区别E-全染色,称此最小的正整数k为图G的邻点可区别E-全色数.设有星图Sn、扇图Fn、轮图Wn与完全图Km,研究得到联图Km∨Wn的邻点可区别E-全色数,根据导出子图的关系,得到Km∨Sn,Km∨Fn的邻点可区别E-全色数.Let G（V,E） be a simple graph,k be a positive integer, and f be a mapping from V（G） UE（G） f（u）≠f（v）,f（u）≠f（uv）,f（v）≠f（uv）,andC（u）={f（u）}∪{f（uv）Iuv∈（G））时,C（u）≠C（v） Then f is called as adjacent vertex distinguishing E-total coloring ofG. The minimal number of k is called as adjacent vertex distinguishing E-total chromatic number of G. Suppose star, fan, wheel, and complete-graph are S., F., Wn, and K., respectively. The adjacent vertex distinguishing E-total coloring of join graph Km∨Wn was discussed first and then its adjacent vertex distin- guishing E-total chromatic number was obtained. According to the relationship of vertex-induced sub- graphs, the adjacent vertex distinguishing E-total chromatic number of join graphs Km∨Fn. and Km∨Wn, were obtained.

关 键 词：联图 导出子图 邻点可区别 E-全染色 邻点可区别E-全色数 

分 类 号：O157.5[理学—数学]