若干Mycielski's图的邻点可区别E-全染色  

Adjacent Vertex-Distinguishing E-Total Coloring on Mycielski's Graph of Some Graphs

作　　者：李沐春[1] 王双利[1] 凌昭昭 张忠辅[1] 

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

出　　处：《数学的实践与认识》2014年第4期152-156,共5页Mathematics in Practice and Theory

基　　金：国家自然科学基金(11061017);甘肃省自然科学基金(1212RJZA039);甘肃省硕导基金(1104-10)

摘　　要：针对简单图G与Mycielski's图之间的关系,讨论了路、圈、星、扇、轮和完全图的Mycielski's图的邻点可区别E-全染色,给出了路、圈、星、扇、轮和完全图的Mycielski's图的邻点可区别E-全色数.This paper focuses on the relation between the basic graph G and it＇s Mycielski graph,the adjacent vertex-distinguishing E-total coloring of the Mycielski＇s graph of path,circle,star,fan,wheel and complete graph are discussed,and the adjacent vertex-distinguishing E-total chromatic numbers on Mycielski＇s graph of path,circle,star,fan,wheel and complete graph are obtained.

关 键 词：Mycielski's图 邻点可区别E-全染色 邻点可区别全色数 

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