|
|||||
|
|
On adjacent-vertex-distinguishing total coloring of graphs |
|
| Authors: | Zhongfu?Zhang,Xiang’en?Chen mailto:chenxe@nwnu.edu.cn" title=" chenxe@nwnu.edu.cn" itemprop=" email" data-track=" click" data-track-action=" Email author" data-track-label=" " >Email author,Jingwen?Li,Bing?Yao,Xinzhong?Lu,Jianfang?Wang |
| Affiliation: | 1. College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, China;Department of Computer, Lanzhou Normal College, Lanzhou 730070, China;Institute of Applied Mathematics, Lanzhou Jiaotong University, Lanzhou 730070, China 2. College of Mathematics and Information Science, Northwest Normal University, Lanzhou 730070, China 3. College of Information and Electrical Engineering, Lanzhou Jiaotong University, Lanzhou 730070, China 4. Institute of Applied Mathematics, Lanzhou Jiaotong University, Lanzhou 730070, China 5. Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing 100080, China |
| Abstract: | In this paper, we present a new concept of the adjacent-vertex-distinguishing total coloring of graphs (briefly, AVDTC of graphs) and, meanwhile, have obtained the adjacent-vertex-distinguishing total chromatic number of some graphs such as cycle, complete graph, complete bipartite graph, fan, wheel and tree. |
| Keywords: | graph proper total coloring adjacent-vertex-distinguishing total coloring adjacent-vertex-distinguishing total chromatic number. |
| 本文献已被 CNKI 万方数据 SpringerLink 等数据库收录！ | |