S_0+F_n与S_1+F_n的邻点强可区别全色数  

On the Adjacent-vertex Strong Distinguishing Total Chromatic Number of S_0+F_n and S_1+F_n

作　　者：张骥[1] 张婷[2] 朱恩强[1] 张玉红[1] 徐文辉[1] 

机构地区：[1]兰州交通大学数理与软件工程学院,甘肃兰州730070 [2]甘肃联合大学电子与信息工程学院,甘肃兰州730000

出　　处：《兰州交通大学学报》2010年第3期153-155,共3页Journal of Lanzhou Jiaotong University

基　　金：国家自然科学基金(10771091)

摘　　要：设G(V,E)是阶数不小与3的简单连通图,k是自然数,f是从V(G)∪E(G)到{1,2,…,k}的映射,满足对任意的uv∈E(G),f(u)≠f(v),f(u)≠f(uv)≠f(v);对任意的uv,uw∈E(G),v≠w,f(uv)≠f(uw);对任意的uv∈E(G),C(u)≠C(v),其中C(u)={f(u)}∪{f(v)|uv∈E(G)}∪{f(uv)|uv∈E(G)}则称f是图G的一个邻点强可区别的全染色法.简记作k-AVSDTC,且称χast(G)=min{k|G的所有k-AVSDTC}为G的邻点强可区别全色数.本文得到了星与扇联图的邻点强可区别全色数.For any vertex u∈V（G）,let TN={u}∪{uv｜uv∈E（G）},v∈V（G）} and let f be a total k-coloring of G.The total coloring neighbor of a vertex u of G is the color set Cf（u）={f（x）｜x∈TN（u）}.For any two adjacent vertices x and y of V（G） such as Cf（x）≠Cf（y）,we refer to f as a k-avsdt-coloring of G（＂avsdt＂is the abbreviation of＂adjacent-vertex strong distinguishing total＂）.The avsdt-coloring of G,denoted by χast（G）,is the minimal number of colors required for a avsdt-coloring of G.In this paper,we have obtained the adjacent-vertex strong distinguishing total chromatic number of S0＋Fn and S1＋Fn（m=0,1）.

关 键 词：星 扇 邻点强可区别全色数 

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