几类圈构造图的(p,1)-全标号The(p,1)-Total Labeling of Few Kinds of Structured Cycle Graphs
刘秀丽
摘要(Abstract)：
一个图G的(p,1)-全标号是一个映射f∶V(G)∪E(G)→{0,1,…k},使得:G的任两个相邻的顶点得到不同的整数;G的任两个相邻的边得到不同的整数;一个点和它的邻边得到的整数至少相差p.(p,1)-全标号的跨度是指两个标号差的最大值.图G的(p,1)-全标号的最小跨度叫(p,1)-全标号数,记作λTp(G).给出了几类圈构造图的(p,1)-全标号.
关键词(KeyWords)： (p,1)-全标号;(p,1)-全标号数;交图
基金项目(Foundation): 菏泽学院科研基金资助项目(XY06SX02)
作者(Author): 刘秀丽
DOI: 10.16393/j.cnki.37-1436/z.2009.02.016
参考文献(References)：
- [1]Griggs J R,Yeh R K.Labeling graphs with a condition at distance two[J].SIAM J.Discrete Math.,1992,5: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):57-66.
- [3]Whittlesey M A,Georges J P,Mauro D W.On theλ-number ofθnand related graphs[J].SIAM J.Discrete Math.,1995,8:449-506.
- [4]Havel F,Yu M L.(p,1)-Total labeling of graphs[J].Discrete Math.,2008,(308):586-595.
- [5]Bollobas A,Le V B,Jeremy P S.Graph Classes[M].Philadelphia:society for Industrial and Applied Mathematics,1999:331-352.
- [6]Bollobas B.Modern Graph Theory[M].New York:Springer-Verlag,1998:145-177.