皇冠图G_(n,m)的邻点可区别全染色  

Total Chromatic Number of Adjacent Vertex-distinguishing for Crown Graph G_(n,m)

作　　者：吉毛卓玛 马刚[1] JI Maozhuoma;MA Gang(College of Mathematics and Computer Science,Northwest University for Nationalities,Lanzhou Gansu 73003)

机构地区：[1]西北民族大学数学与计算机科学学院,甘肃兰州730030

出　　处：《宁夏师范学院学报》2018年第7期31-34,共4页Journal of Ningxia Normal University

基　　金：甘肃省自然科学基金资助项目(145RJZA158)

摘　　要：根据皇冠图的结构,用构造法给出了皇冠图G_(n,m)的邻点可区别全染色,得到了其邻点可区别全色数.In this paper,according to the structure of the Crown Graph,the adjacent Vertex distinguishable total coloring of the crown graph Gn,mis established by the construction method,then the total chromatic number of adjacent vertex distinguishable is obtained.

关 键 词：图 皇冠图 邻点可区别全染色 邻点可区别全色数 

分 类 号：O157.5[理学—数学]