期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

轮图的(2,1)-全标号

The (2,1)-total Labelling of Wheel Graphs
下载PDF
导出
摘要 图G的一个k-(d,1)-全标号是一个映射f:V(G)UE(G)→︱0,1,…,︱使得任意2个相邻的点和相邻的边有不同的值,且任一对相关联的点和边的值的差的绝对值至少为d.G的(d,1)-全标号数定义为λrd(G)有一个k-(d,1)-全标号的最小的k值,得到了轮图的(2,1)-全标号. The （d,1） -total labelling number λd^T（G） of a graph G is the width of the smallest range of integers that suffices to label the vertices and edges of G such that no two adjacent vertices or two adjacent edges have the same labels and the difference between the labels of a vertex and its incident edges is at least d.The （2,1）-total labelling numbers of Wheel graphs were presented.
作者 徐春雷 王菊 冯伟 吉日木图
机构地区 内蒙古民族大学数学学院
出处 《内蒙古民族大学学报（自然科学版）》 2009年第6期615-616,共2页 Journal of Inner Mongolia Minzu University：Natural Sciences
关键词 (d 1)-全标号 距离2标号 轮图 （d,1）-total labelling Distance two labelling Wheel graphs
分类号 O157.5 [理学—基础数学]
  • 相关文献

参考文献12

  • 1Griggs J R K.labellings graphs with a condition at distance two [J].SIAM J Discrete Math, 1992,5 (4):586-595.
  • 2Gerlard J C,David K.The L(2,1 )-labelling problem on graphs[J].SIAMJ Discrete Math,1996,9(2):309-316.
  • 3Georges J P,Mauro D W,Stein M.I.Labelling Products of complete graphs with a condition at distance two[J].SIAM Discrete Math,2000,14 ( 1 ):28-35.
  • 4Wang WeiFan,Lih K W.labelling planar graphs with conditions on girth and distance two [J].SIAM JDiscrete Math,2004,17 (2):264-275.
  • 5Michael M,Mohammad R S. A bound on the chromatic number of the square of a planar graph[J].J Combin Theory Ser B, 2005,94(2):189-213.
  • 6Whittleesey M A,Georges J P,Mauro D W .On theλ -number of related graphs [J].SIAM J Discrete Math,1995,8 (4): 499-506.
  • 7Havet F,Yu M A,Georges J P,et al.On the λ -number of Qn and related graphs [J].SIAM J Discrete Math,1995,8 (4): 499-506.
  • 8Havet F.Upper bound for thespan of (s,l)-total labelling of graph[J].INRIA,2003(4816):1-12.
  • 9陈东,王维凡.两类积图的(2,1)-全标号[J].浙江师范大学学报（自然科学版）,2006,29(1):26-31. 被引量：3
  • 10Chen Dong ,Wang weifan. (2,1 )-total labelling of outplanar graphs [J].Discrete Applied Math,2007,155 (18) :2585-2593.

二级参考文献20

  • 1陈东,王维凡.两类积图的(2,1)-全标号[J].浙江师范大学学报（自然科学版）,2006,29(1):26-31. 被引量：3
  • 2Whittlesey 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.
  • 3Havet F,Yu M L.(d,1)-total labelling of graphs[J].INRIA,2002(4650):1-21.
  • 4Havet F.Upper bound for the span of (s,1)-total labelling of graphs[J].INRIA,2003(4816):1-12.
  • 5Bondy J A,Murty U S R.Graph theory with applications[M].New York:Macmillan,1976.
  • 6Griggs J R,Yeh R K.Labelling graphs with a condition at distance two[J].SIAM J Discrete Math,1992,5 (4):586-595.
  • 7Chang G J,Kuo D.The L(2,1)-labelling problem on graphs[J].SIAM J Discrete Math,1996,9(2):309-316.
  • 8Georges J P,Mauro D W,Stein M I.Labelling products of complete graphs with a condition at distance two[J].SIAM J Discrete Math,2001,14(1):28-35.
  • 9Wang Weifan,Lih K W.Labelling planar graphs with conditions on girth and distance two[J ].SIAM J Discrete Math,2004,17 (2):264-275.
  • 10Molloy M,Salavatipour M R.A bound on the chromatic number of the square of a planar graph[J].J Combin Theory Ser B,2005,94(2):189-213.

共引文献2

内蒙古民族大学学报（自然科学版）
2009年 第6期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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