两类k重Mycielski图的邻点强可区别E-全染色  

On Adjacent Vertex Strongly Distinguishing E-total Coloring of Two classes k-multi-Mycielski Graphs

作　　者：李雨虹 强会英[1] 王洪申[2] LI Yu-hong QIANG Hui-ying WANG Hong-shen(School of Mathematics, Lanzhou Jiaotong University, Lanzhou Gansu 730070, China School of Mechatronie Engineering, Lanzhou University of Technology, Lanzhou Gansu 730050, China)

机构地区：[1]兰州交通大学数理与软件工程学院,甘肃兰州730070 [2]兰州理工大学机电工程学院,甘肃兰州730050

出　　处：《淮阴师范学院学报（自然科学版）》2017年第3期205-209,共5页Journal of Huaiyin Teachers College;Natural Science Edition

基　　金：国家自然科学基金资助项目(11461038;11561042)

摘　　要：应用反证法和构造染色函数法研究了图M^k(F_n)和M^k(W_n)的邻点强可区别E-全染色,并得出了其邻点强可区别E-全色数.The adjacent vertex strongly distinguishing E-total coloring of k-multi-Mycielski Graphs of Mk（ Fn） and Mk（ Wn） are givening by contradiction and constructing colorable function,meanwhile,the adjacent vertex strongly distinguishing E-total chromatic of them are obtained.

关 键 词：邻点强可区别全染色 k重Mycielski图 邻点强可区别E-全染色 

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