摘要
令G=(V(G),V(G))是一个简单图,Mp(G)为图G广义Mycielski图。图G的L(2,1)标号数,记作λ(G),定义为λ(G)=min{k|G有一个k-L(2,1)标号}。n个顶点的路、圈分别记作Pn,Cn。给出了路和圈的广义Mycielski图的L(2,1)标号数λ(Mp(Pn))和λ(Mp(Cn))。
Let G=(V(G),V(G)) be a simple graph, Mp(G) is the General Mycielski Graph of G. The L(2,1)-labeling number of G, denoted by λ(G), is the smallest number k such that G has an L (2, 1)-labeling. The path and cycle with n vertices are denoted by P., C.. In this paper, we derive the L(2,1)-labeling number λ (Mp (Pn) ) and λ (Mp (Cn) ) of General Mycielski Graph of Path and Cycle.
出处
《上海电机学院学报》
2007年第2期153-155,158,共4页
Journal of Shanghai Dianji University