扭立方体图的全色数和邻点可区别全色数Total and Adjacent Vertex-distinguishing Total Chromatic Numbers of Twisted Cubes
陈美润;
摘要(Abstract)：
本文研究扭立方体图的全色数和邻点可区别全色数,确定了他们的精确值.通过这两个参数的值说明扭立方体图满足著名的全染色猜想(TCC)和邻点可区别全染色猜想.
关键词(KeyWords)： 正常全染色;全色数;邻点可区别全染色;邻点可区别全色数;扭立方体图
基金项目(Foundation): 国家自然科学基金(11101345);; 福建省自然科学基金(2016J01041);; 福建省教育厅项目(JA12244)
作者(Authors): 陈美润;
DOI: 10.13568/j.cnki.651094.2017.01.005
参考文献(References)：
- [1]Behzad Mehdi.Graphs and their chromatic numbers[D].East Lansing:Michigan State University,1965.
- [2]Vizing Vadim Georgievich.Some unsolved problems in graph theory[J].Uspekhi Mat Nauk,1968,23:117-134.
- [3]Zhang Zhongfu,Chen Xiang’en,Li Jingwen.On the adjacent vertex-distinguishing total coloring of graphs[J].Science in China Ser A Mathematics,2005,48:289-299.
- [4]Chen Meirun,Guo Xiaofeng,Li Hao,et al.Total chromatic number of generalized Mycielski graphs[J].Discrete Mathematics,2014,334:48-51.
- [5]Chen Meirun,Zhai Shaohui.Total and adjacent vertex-distinguishing total chromatic numbers of augmented cubes[J].Ars Combinatorics,2014,114:87-96.
- [6]Huang Wentzeng,Tan Jimmy,Hung Chunnan,et al.Fault-tolerant hamiltoncity of twisted cubes[J].Journal of Parallel and Distributed Computing,2002,62:591-604.