期刊文献+

广义Petersen图的L(d,1)-标号 被引量:2

On Generalized Petersen Graphs Labeled with L(d,1)-
下载PDF
导出
摘要 图G的顶点集到非负整数集的一个映射f满足:对任意的x,y∈V(G),当dG(x,y)=1时,有f(x)-f(y)≥d;当dG(x,y)=2时,有f(x)-f(y)≥1。图的一个k-L(d,1)-标号是指图的一个标号L(d,1)使得min{f(v)|v∈V(G)}=k,标号数简记为λd(G)。研究了广义的Petersen图的标号L(d,1),给出一个特殊的标号方法,得到了广义的Petersen图的标号数λd(G)≤4d。 An L( d, 1 ) - labeling of graph G is an integer labeling of the vertices in V(G) such that adjacent vertices receive labels which differ by at least d, and vertices which are distance two apart receive labels which differ by at least one. The λd - number of G is the minimum span taken over all L(d,1 ) - labelings of G. in this paper,we show that the λd - number of every generalized Petersen graph is bounded by 4d
出处 《济南大学学报(自然科学版)》 CAS 2007年第3期256-258,共3页 Journal of University of Jinan(Science and Technology)
基金 山东省自然科学基金(Y2003A01)
关键词 运筹学 L(d 1)-标号 PETERSEN图 广义的Petersen图 operation research L( d, 1 ) - number petersen graph generalized petersen graph
  • 相关文献

参考文献3

二级参考文献15

  • 1Hale W K.Frequency Assignment:Theory and Applications[J],Proc IEEE,1980,68:1497—1514.
  • 2Georges J,Mauro D,and Whittlesey M.Relating Path Covering to Vertex Labelings with a Condition at Distance Two[J].Discrete Math,1994,135:103—111.
  • 3Roberts F S.T-colorings of Graphs:Recent Results and Open Problems[J],Discrete Math,1991,7:133—140.
  • 4Chang Gerard J,Kuo David.The L(2,1)-Lebeling Problem On Graphs[J].SIAM J.Discrete Math,1996,2:309—316.
  • 5Gfiggs Jerrold R,Yeh Roger K.IJabeling Graphs with a Condition at Distance 2[J].SIAM J Discrete Math,1992,5:586—595.
  • 6Bondy J A,Murty U S R.Graph Theory with Applications[M].New York:Macmillan,1976.
  • 7J A Bondy, U S R Murty. Graph theory with applications[M]. New Yrok: North Holland, 1976.
  • 8Gerard J Chang, David Kuo. The L( 2,1)- labeling problem on graphs[J]. SIAM J. Discrete Math. , 1996,2(2) :309-316.
  • 9M B Cozzens,F S Roberts. T-Colorings of graphs and the channel assignment problem[J]. Congr. Numer,1982,35(2) :191-208.
  • 10Jerrold R Griggs, Roger K Yeh. Labeling graphs with a condition at distance 2 [J].SIAM J. Discrete Math. , 1992,5(2):586-595.

共引文献8

同被引文献13

  • 1马登举,任韩,卢俊杰.广义Petersen图G(2m+1,m)的交叉数[J].华东师范大学学报(自然科学版),2005(1):34-39. 被引量:8
  • 2田双亮,张忠辅.广义Petersen图G(n,k)的邻强边染色[J].兰州大学学报(自然科学版),2005,41(4):100-101. 被引量:20
  • 3马巧灵,张苏梅,刘成立.自补图的L(2,1)-标号[J].济南大学学报(自然科学版),2006,20(2):182-183. 被引量:2
  • 4张苏梅,王纪辉.高度平面图的L(p,q)-标号[J].山东大学学报(理学版),2007,42(4):39-43. 被引量:5
  • 5GRIGGS J R, YEH R K. labeling graphs with a condition at distance 2[J]. SIAM J Discrete Math, 1992, 5(4):586-595.
  • 6GEORGES J P, MAURO D W, STEIN M I. Labeling products of complete graphs with a condition at distance two[J]. SIAM J Discrete Math, 2000, 14(1):28-35.
  • 7GEORGES J P, MAURO D W, WHITTLESEY M A. Relating path covering to vertex labelings with a condition at distance two[J]. Discrete Math, 1994, 135:103-111.
  • 8ZHANG Su-mei, MA Qiao-ling. Labelling some planar graphs with a condition at distance two[J]. Applied Mathematics & Computing, 2007, 24( 1 ) :421-426.
  • 9WHITTLESEY M A, GEORGES J P, MAURO D W. On the λ-number of Qn and related graphs[J]. SIAM J Discrete Math, 1995, 8 (4) : 499-506.
  • 10HAVET F, YU M-L. ( d, 1)-total labelling of graphs: Technical Report 4650[R]. Sophia Antipolis: INRIA, 2002.

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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