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

图的局部k限制边连通性及最优性

Local k Restricted-edge Connectivity and Local λ_k-optimal Properties of Graphs
原文传递
导出
摘要 首先研究图的局部k限制边连通性问题和局部λ_k-连通图的存在性问题.然后研究图的局部λ_k最优性,并且应用邻域条件得到了一个保证图局部λ_k最优的充分条件. In this paper, we firstly study on the problems of local k restricted-edge connec- tivity properties of graphs and the existence of local λk-connected graphs. Then we study on the local λk-optimal properties of graphs and obtain a neighborhood condition for graphs to be local λk-optimal.
作者 高敬振 吴芳
机构地区 山东师范大学数学科学学院 济南经十一路小学
出处 《数学的实践与认识》 CSCD 北大核心 2014年第8期210-217,共8页 Mathematics in Practice and Theory
基金 山东省软科学研究计划项目(2013RKB01498) 山东省高校科技计划项目(G13L504)
关键词 图 局部λk-连通图 局部λk最优图 graph local λk-connected graphs local Ak-optimal graphs
分类号 O157.5 [理学—基础数学]
  • 相关文献

参考文献11

  • 1Bollobas B.Modern Graph Theory[M]. New York: Springer-Verlag, 1998.
  • 2王世英,林上为.网络边连通性的最优化[M].科学出版社,2009.
  • 3Hellwig A, Volkmann L. Maximally edge-connected and vertex-connected graphs and digraphs: A survey[J]. Discrete Mathematics, 2008, 308: 3265-3296.
  • 4Hellwig A, Volkmann L. Maximally local-edge-connected graphs and digraphs[J]. Ars Combin, 2004, 72: 295-306.
  • 5Esfahanian A H, Hakimi S L. On computing a conditional edge connectivity of a graph[J]. Inf Process Letter, 1988, 27:195-199.
  • 6王应前,李乔.ON THE EXISTENCE OF THE h-RESTRICTED EDGE CONNECTIVITY OF A GRAPH[J].Journal of Shanghai Jiaotong university(Science),2001,6(2):131-133. 被引量：2
  • 7Ou J P. Edge cuts leaving components of order at least m[J]. Discrete Mathematics, 2005, 305: 365-371.
  • 8Zhang Z, Yuan J J. Degree conditions for restricted-edge connectivity and isoperimetric-edge- connectivity to be optimal[J]. Discrete Mathematics, 2007, 307: 293-298.
  • 9Wang S Y, Lin S W, Li C F. Sufficient conditions for super k-restricted edge connectivity in graphs of diameter 2[J]. Discrete Mathematics, 2009, 309(4): 908-919.
  • 10林上为,王世英,李春芳.λk最优图的充分条件[J].数学的实践与认识,2008,38(12):208-213. 被引量：2

二级参考文献11

  • 1Bondy J A, Murty U S R. Graph Theory with Applications[M]. New York: The Macmillan Press Ltd,1976.
  • 2Esfahanian A H, Hakimi S L. On computing a conditional edge-connectivity of a graph[J]. Inform Process Lett, 1988,27 : 195-199.
  • 3Bonsma P, Ueffing N, Volkmann L. Edge-cuts leaving components of order at least three[J]. Discrete Math, 2002,256:431-439.
  • 4Ou Jianping. Edge cuts leaving components of order at least m[J]. Discrete Math, 2005,305:365-371.
  • 5Zhang Zhao, Yuan Jinjing. A proof of an inequality concerning k-restricted edge connectivity[J]. Discrete Math, 2005.304 : 128-134.
  • 6Meng Jixiang, Ji Youhu. On a kind of restricted edge connectivity of graphs [J]. Discrete Appl Math,2002,117: 183-193.
  • 7Meng Jixiang. Optimally super-edge-connected transitive graphs[J]. Discrete Math,2003,260:239-248.
  • 8Wang Ming, Li Qiao. Conditional edge connectivity properties, reliability comparisons and transitivity of graphs[J]. Discrete Math,2002,258:205-214.
  • 9Hellwig A, Volkmann L. Sufficient conditions for λ'-optimality in graphs of diameter 2[J]. Discrete Math,2004, 283:113-120.
  • 10Zhang Zhao, Yuan Jinjing. Degree conditions for restricted-edge connectivity and isoperimetric-edge-connectivity to be optimal[J]. Discrete Math, 2007,307 : 293-298.

共引文献2

数学的实践与认识
2014年 第8期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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