圈的平方图的Smarandachely邻点全色数On the Smarandachely Adjacent Vertex Total Coloring of C_n~2
卫斌;朱恩强;文飞;徐文辉;
摘要(Abstract)：
对简单图G(V,E)f,是从V(G)∪E(G)到{1,2,Λ,k}的映射,k是自然数,若f满足(1)u,v∈E(G),u≠,f(u)≠f(v);(2)uv,uw∈E(G),v≠w,f(uv)≠f(uw);(3)uv∈E(G),\C(u)\C(v)\≥1并且|C(v)\C(u)|≥1;则称f是G的Smarandachely邻点全染色.本文给出了圈的平方图的的Smarandachely邻点全色数.
关键词(KeyWords)： 圈;平方图;Smarandachely邻点全染色
基金项目(Foundation): 国家自然科学基金项目资助(No.10771091)
作者(Authors): 卫斌;朱恩强;文飞;徐文辉;
DOI: 10.16778/j.cnki.1671-5934.2011.06.002
参考文献(References)：
- [1]BURRIS A C,SCHELP R H.Vertex-distinguishing proper edge-coloring[J].Journal of Graph Theory.1997,26(2):73-82.
- [2]BALISTER P N,GYORI E,LEHEL J,et al.Adjacent vertex distinguishing edge-colorings[J].Journal Graph Theory,2003,42:95-109.
- [3]HATAMI H.+300is a bound on the adjacent vertex distinguishing edge chromatic number[J].Journal of combinatorial Theory,Series B2005,95:246-256.
- [4]ZHANG Zhongfu,LIU Linzhong,WANG Jianfang.Adjacent strong edge coloring of graphs,Appl Math Lett2002,15:623-626
- [5]张婷,李沐春,徐保根,等.关于Cm×Cn的全色数和邻强边色数[J].兰州交通大学学报,2007,26(6):124-126.
- [6]LI Jingwen,ZHANG Zhongfu,CHEN Xiangen,et al.D(β)-vertex-distinguishing proper edge-coloring of graphs[J].(chi-nese)Acta Math.Sinica(chin.Ser.),2006,15:703-708.
- [7]ZHANG Zhongfu,QIU Pengxiang,XU Baogen,et al.vertex-distinguishing total coloring of graphs[J].Ars comb.2008,87:33-45.
- [8]ZHANG Zhongfu,XU Wenhui,LIU Guodong,et-al.The Smarandachely Adjacent Vertex Total Coloring of graphs[EB/OL].http:∥202.201.18.40:8080/mas5/
- [9]BURRIS A C,SCHELP R H.Vertex-distinguishing edge-colorings[J].Journal Graph Theory,1997,20(2):73-82.