几类特殊图的Mycielski图的(2,1)-全标号  

(2,1)-Total Labelling on Mycielski’s Graphs of Several Kinds of Particular Graphs

作　　者：刘秀丽 LIU Xiu-li(School of Mathematics and Statistics,Heze University,Heze Shandong 274015,China)

机构地区：[1]菏泽学院数学与统计学院

出　　处：《西南大学学报（自然科学版）》2018年第12期100-104,共5页Journal of Southwest University(Natural Science Edition)

基　　金：山东省自然科学基金项目(ZR2014AM032);山东省高校科技计划项目(J13LI02)

摘　　要：研究了与频道分配有关的一种染色问题:(p,1)-全标号.根据Mycielski图的构造特征,利用穷染法,给出了一种标号方法,得到了路、圈、扇和轮的Mycielski图的(2,1)-全标号数.(p,1)-全标号是对图的全染色的一种推广。A coloring problem(p,1)-total labelling of some graphs,which is related to frequency assignment,is studied.By using the eternal coloring method,a new labelling method is given according to the feature of Mycielski’s graphs,and the(2,1)-total numbers of path,cycle,fan and wheel of the graphs are obtained.And the(p,1)-total labelling of graphs extends the total coloring of graphs.

关 键 词：染色 (P 1)-全标号 (p 1)-全标号数 MYCIELSKI图 

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