The Smarandachely Strong Adjacent Vertex Total Coloring of Join Graph

摘要：

The Smarandachely Strong adjacent vertex total chromatic number of graph G=(V,E) is the smallest number of colors assignable to E and V so that any two adjacent vertices u and v satisfying: |C(u) C(v)| ≥ 2 and |C(v) C(u)| ≥ 2.Obviously,this chromatic is exist when d(G) ≥ 3.In this paper,we obtain the Smarandachely Strong adjacent vertex total chromatic number of Sm+Fn in some conditions.

作者: Zhiwen Wang Zhongfu Zhang

作者单位: School of Mathematics and Computer Sciences, Ningxia University, Yinchuan, 750021, P.R.China Institute of Applied Mathematics, Lanzhou Jiaotong University, Lanzhou, 730070, P.R.China

会议类型: 国际会议

会议名称: The 4th International Conference on Bioinformatics and Biomedical Engineering(第四届IEEE生物信息与生物医学工程国际会议 iCBBE 2010)

会议地点: 成都

会议语种:英文

页码: 1-3

在线出版日期: 2010-06-18（万方平台首次上网日期，不代表论文的发表时间）