可满着色图的一种结构  

One structure of full colorable graphs

作　　者：赵小玲[1] ZHAO Xiaoling(School of Arts and Sciences,Shanghai Dianji University,Shanghai 201306,China)

机构地区：[1]上海电机学院文理学院,上海201306

出　　处：《上海电机学院学报》2020年第6期369-372,共4页Journal of Shanghai Dianji University

摘　　要：图的标号作为一种资源,能够得到充分利用是最优化的选择。因此,连续标号问题和可满着色图成为图的标号问题的一个重要研究对象。通过对广义Mycielski图以及它的补图的结构的研究,得到了一类具有连续标号的可满着色的连通图——任意图的广义Mycielski图。As a kind of resource,the labeling of graphs can be fully utilized,which is the optimal choice.Therefore,the consecutive labeling problem and the full colorable graph become the key research objects of graph labeling problems.In the present paper,by studying the structures of the generalized Mycielski graph and its complement graph,we obtain a connected full colorable graph wiTHthe consecutive L(2,1)-labeling,which is called the generalized Mycielski graph of an arbitrary graph.

关 键 词：广义MYCIELSKI图 可满着色图 标号 

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