期刊文献+

路和圈的广义Mycielski图的L(2,1)标号 被引量:1

The L(2,1)-Labelings on General Mycielski Graph Of Path and Cycle
下载PDF
导出
摘要 令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
关键词 频道分配问题 广义MYCIELSKI图 L(2 1)标号 L(2 1)标号数 channel assignment problem path cycle general Mycielski graph L (2,1)-labeling L (2,1)-labeling number
  • 相关文献

参考文献6

  • 1[1]Roberts J R,Yeh R K.Labeling Graphs with a Condition at Distance 2[J].SIAM J Discrete Math,1992,5(4):586-595.
  • 2[2]West D B.Introduction to Graph Theory[M].2nd ed.NJ:Prentice Hall,Inc,2001.
  • 3[3]Boundy J A,Murty S R.Graph Theory with Applications[M].London:The Macmillan Press Ltd,1976.
  • 4[4]Chang G J,Kuo D.The L(2,1)-Labeling Problem on Graphs[J].SIAM J Discrete Math,1996,9 (2):309-316.
  • 5[5]Lu C,et al.Extremal Problem on Consecutive L(2,1)-labeling[J].Disc Math Appl,2007:doi; 10.1016/j.dam.2006.12.002.
  • 6[6]Calamoneri T.Optimal L (h,k)-labeling of Regular Grids[J].Discrete Mathematics and Theoretical Computer Science,2006,8:141-158.

同被引文献1

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部