两类全图的(2,1)-全标号The(2,1)-Total Labeling of Two Kinds of Graphs
刘秀丽
摘要(Abstract)：
一个图G的(p,1)-全标号是一个映射f∶V(G)∪E(G)→{0,1,…k},使得:G的任两个相邻的顶点得到不同的整数;G的任两个相邻的边得到不同的整数;任一个点和与它相关联的边得到的整数至少相差p.(p,1)-全标号的跨度是指两个标号差的最大值.图G的(p,1)-全标号的最小跨度叫(p,1)-全标号数,记作λpT(G).得到了两类全图的(2,1)-全标号数.
关键词(KeyWords)： (p,1)-全标号;(p,1)-全标号数;全图
基金项目(Foundation):
作者(Author): 刘秀丽
DOI: 10.16393/j.cnki.37-1436/z.2010.02.004
参考文献(References)：
- [1]Griggs J R,Yeh R K.Labeling graphs with a condition at distance two[J].SIAM J.Discrete Math.,1992,5(4):586-595.
- [2]Chang G J,Ke W T,Yeh R K,et al.OnL(d,1)-labeling of graphs[J].Discrete Math.,2000,220(1):57-66.
- [3]Whittles M A,Georges J P,Mauro D W.On theλ-number ofQnand related graphs[J].SIAM J.Discrete Math.,1995,8(4):499-506.
- [4]Havet F,Yu M L.(p,1)-Total labeling of graphs[J].Discrete Math.,2008,308(4):496-513.
- [5]Shao Z D,Yeh R K,Zhang D.The L(2,1)-labeling on graphs and the frequency assignment problem[J].Applied Math.Lett,2008,21(1):37-41.
- [6]Chen Dong,Wang Wei-fan.(2,1)-Total labeling of outer planar graphs[J].Discrete Applied Mathematics,2007,155:2585-2593.
- [7]Bollobas B.Modern Graph Theory[M].New York:Springer-Verlag,1998:145-177.
- [8]Bondy J A,Murty U S R.Graph Theory with Applications[M].London:Macmillan Press Ltd,1976:128-129.