图P_n□C_m的邻点可区别I-全染色Adjacent vertex-distinguishing I-total colorings of P_n□C_m
杨晓亚;
摘要(Abstract)：
通过对图Pn□Cm的积图的邻点可区别全染色研究,来进一步验证邻点可区别全染色的猜想.应用构造具体染色的方法给出了图Pn□Cm的积图的邻点可区别全染色.得到了图Pn□Cm的积图的邻点可区别全染色的色数.
关键词(KeyWords)： I-全染色;邻点可区别I-全染色;邻点可区别I-全色数
基金项目(Foundation): 甘肃省自然科学基金(096RJZE106);; 天水师范学院中青年教师科研资助项目(TSA1102)
作者(Authors): 杨晓亚;
参考文献(References)：
- [1]Favaron O,Li H,Schelp R H.Strong edge colorings of graphs[J].Discrete Mathematica,1996,159:103-109.
- [2]Zhang Zhongfu,Liu Linzhong,Wang Jianfang.Adjacent strong edge coloring of graphs[J].Applied Mathe-matica Letters,2002,15:623-626.
- [3]Li Jingwen,Zhang Zhongfu,Chen Xiang′en,et al.A note on adjacent strong edge coloring of K(n,m)[J].Acta Mathematicae Applicatae Sinica(English Series),2006,22(2):273-276.
- [4]Zhang Zhongfu,Li Muchun,Yao Bing,et al.On the vertex distinguishing equitable edge-colouring ofgraphs[J].Ars Combinatoria,2008,86:193-200.
- [5]陈祥恩.关于图rK2∨Ks的邻点可区别全色数[J].兰州大学学报,2007,43(5):91-93.
- [6]陈祥恩,张忠辅.关于图K2n+1E(2K2)的邻点可区别全色数[J].兰州大学学报,2005,41(6):102-105.
- [7]Zhang Zhongfu,Woodall D R,Yao Bing,et al.Adjacent vertex-distinguishing I-total coloring of graphs[EB/OL].(2008-06-12)[2008-07-24]http://202.201.18.40:8080/mas5/.
- [8]Bondy J A,Murty U S R.Graph Theory[M].London:Springer,2008.
- [9]王治文,文飞,杨随义,等.图K2n\E(F5)(n≥13)的点可区别边染色[J].河南师范大学学报,2010,38(6):1-3.