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

On the Adjacent Vertex Strongly Distinguishing E-total Coloring of Two Mycielski Graphs

作　　者：李雨虹 强会英[1] 王洪申[2] 杨笑蕊 LI Yu-hong;QIANG Hui-ying;WANG Hong-shen;YANG Xiao-Rui(School of Mathematics,Lanzhou Jiaotong University,Lanzhou 730070,Chin;School of Mechanical and Electrical Engineering,Lanzhou University of Technology,Lanzhou730050,China)

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

出　　处：《兰州文理学院学报（自然科学版）》2018年第3期34-37,63,共5页Journal of Lanzhou University of Arts and Science(Natural Sciences)

基　　金：随机图的可区别染色算法及复杂网络中的应用(11461038);图的拟laplace能量和关联能量(11561042)

摘　　要：应用反证法和构造染色函数法研究了距离为三的图F_n和W_n的k重Mycielski图的邻点强可区别E-全染色,并得出了其邻点强可区别E-全色数.In this paper,the adjacent vertex strongly distinguishing E-total coloring of distance with three k-multi-Mycielski Graphs of Fn and Wn are given by contradiction and constructing colorable function,meanwhile,the adjacent vertex strongly distinguishing E-total chromatic of them are ob-tained.

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

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