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

On the Adjacent Vertex Strongly Distinguishing E-total Coloring of two Special Graphs

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

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

出　　处：《淮阴师范学院学报（自然科学版）》2018年第4期283-288,共6页Journal of Huaiyin Teachers College;Natural Science Edition

基　　金：国家自然科学基金资助项目(11561042);国家自然基金应急管理资助项目(61640207)

摘　　要：邻点强可区别全染色的定义弱化其中的一个条件,即相邻边可以染同色时,则可得到邻点强可区别E-全热色的概念.利用反证法和构造函数染色法得出距离为2的扇图和轮图的K重Mycielski图的邻点强可区别E-全染色以及其全色数.When the definition of Adjacent Vertex Strongly Distinguishing total Coloring weakens one of the conditions,that is,the adjacent edges can be dyed the same color.Then the concept of Adjacent Vertex Strongly Distinguishing E-total Coloring can be obtained.The adjacent vertex strongly distinguishing E-total coloring of distance with two k-multi-Mycielski Graphs of Fan and wheel were given by contradiction and constructing colorable function,meanwhile,the adjacent vertex strongly distinguishing E-total chromatic of them are obtained.

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

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