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

自补图的L(2,1)-标号 被引量：2

The L(2,1)-labeling Problem on Self-complementary Graphs
下载PDF
导出
摘要 研究自补图G的L(2,1)-标号问题,证明了自补图的L(2,1)-标号数满足λ(G)≤2Δ。验证了关于一般图的L(2,1)-标号数的猜想λ(G)≤Δ2对于自补图的正确性。 A graph G is said to be self- complementary if it is isomorphic with its complement. In this paper, we studied the problem of L （2, 1 ） - labeling on self - complementary graphs and proved that λ （G） ≤ 2△ for self- complementary graphs. The well - known conjecture that λ （ G ） ≤ △^2 for self - complementary graphs has been verified.
作者 马巧灵 张苏梅 刘成立
机构地区 济南大学理学院
出处 《济南大学学报（自然科学版）》 CAS 2006年第2期182-183,共2页 Journal of University of Jinan(Science and Technology)
基金 山东省自然科学基金(Y2003A01)
关键词 运筹学 自补图 L(2 1)-标号 operation research self - complementary graph labeling
分类号 O157.5 [理学—基础数学]
  • 相关文献

参考文献2

二级参考文献13

  • 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.

共引文献7

同被引文献13

  • 1马巧灵,张苏梅.广义Petersen图的L(d,1)-标号[J].济南大学学报（自然科学版）,2007,21(3):256-258. 被引量：2
  • 2张苏梅,王纪辉.高度平面图的L(p,q)-标号[J].山东大学学报（理学版）,2007,42(4):39-43. 被引量：5
  • 3GRIGGS J R, YEH R K. labeling graphs with a condition at distance 2[J]. SIAM J Discrete Math, 1992, 5(4):586-595.
  • 4GEORGES 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.
  • 5GEORGES 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.
  • 6ZHANG Su-mei, MA Qiao-ling. Labelling some planar graphs with a condition at distance two[J]. Applied Mathematics & Computing, 2007, 24( 1 ) :421-426.
  • 7WHITTLESEY 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.
  • 8HAVET F, YU M-L. ( d, 1)-total labelling of graphs: Technical Report 4650[R]. Sophia Antipolis: INRIA, 2002.
  • 9HAVET F. ( d, 1 )-total labelling of graphs[ C ]//Workshop on Graphs and Algorithms, Dijon: [ s. n. ], 2003.
  • 10Fabrice Bazzaro, Mickael Montassier, Andre Raspaud. ( d, 1)-total labeling of planar graphs with large girth and high maximum degree: Research Report RR-1307-03.19[R]. [S.l.] Janvier, 2004.

引证文献2

二级引证文献2

济南大学学报（自然科学版）
2006年 第2期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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