期刊文献+

二部图2-等周边连通度最优的充分条件 被引量:3

A Sufficient Condition for the Optimum 2-Isoperimetric-Edge-Connectivity of a Bipartite Graph
下载PDF
导出
摘要 图G的k-等周边连通度是图的边连通度概念的推广。通过考虑无向图等周边连通度与不相邻顶点对邻域之间的关系,给出了二部图的2-等周边连通度最优的充分条件。 The k-isoperimetric edge connectivity is a generalization of edge connectivity of a graph.By thinking about the relationship between isoperimetric edge connectivity and the neighborhood of nonadjacent vertices pairs,the paper provides a sufficient condition for the case that the bipartite graphs are γ2-optimal.
作者 段晋芳 原军
出处 《太原科技大学学报》 2010年第4期309-311,共3页 Journal of Taiyuan University of Science and Technology
基金 山西省自然科学基金(2008011013)
关键词 边连通度 k-等周边连通度 edge connectivity k-restricted edge connectivity
  • 相关文献

参考文献7

  • 1BONDY J A,MURTY U S R.Graph Theory with Applications[M].NewYork:The Macmillan Press Ltd,1976.
  • 2HARARY F.Conditional connectivity[J].Networks,1983,13:347-357.
  • 3HAMIDOUNE Y,LLADO A,SERRA O.On isoperimetric connectivity in vertex-transitive graphs[J].SIAM J Disc Math,2000,13:139-144.
  • 4ZHANG Z,YUAN J.Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal[J].Discrete Math,2007,307:293-298.
  • 5WANG S Y,LIN S W,LI C F.Sufficient conditions for super k-restricted edge connectivity in graphs of diameter 2[J].Discrete Math,2009,309:908-919.
  • 6王铭,李乔.关于图的超常边连通度和等周边连通度的等值性[J].上海交通大学学报,2002,36(6):858-860. 被引量:3
  • 7YUAN J,LIU A X,WANG S Y.Sufficient conditions for bipartite graphs to be supper-k-restricted edge connected[J].Discrete Mathematics,2009,309(9):2886-2896.

共引文献2

同被引文献11

  • 1朱强,徐俊明.立方体和折叠立方体的限制边连通度和超边连通度(英文)[J].中国科学技术大学学报,2006,36(3):249-253. 被引量:17
  • 2ESFAHANIAN A H, HAKIMI S L. On computing a conditional edge connectivity of a graph [ J ]. Information Processing Letters, 1988,27 : 195-199.
  • 3BONDY J A, MURTY U S R. Graph theory with applications[ M ]. New York:The Macmillan Press Ltd, 1976.
  • 4WANG SHIYING,LIN SHANGWEI, LI CHUNFANG. Sufficient conditions for super-k-restricted edge connectivity in graphs of diameter 2 [ J ]. Discrete Mathematics,2009,309 (4) :908-919.
  • 5YUAN JUN, LIU AIXIA, WANG Shiying. Sufficient conditions for bipartite graphs to be supper-k-restricted edge connected [ J ]. Discrete Mathematics,2009,309 (9) :2886-2896.
  • 6ZHANG ZHAO. Sufficient conditions for restricted-edge-connectivity to be optimal [ J ]. Discrete Mathematics, 2007,307 (22) : 2891-2899.
  • 7YUAN JUN, LIU AIXIA. The k-restricted edge connectivity of balanced bipartite graphs [ EB/OL]. (2010-08-05)[ 2010-08- 10 ]. http ://www. springerlink, com/content/33743422ut936t07/fulhext, pdf.
  • 8李春芳,林上为.超级等周边连通图的邻域条件[J].太原科技大学学报,2009,30(5):412-414. 被引量:1
  • 9林丽美,周书明.排列图的代数性质[J].福建师范大学学报(自然科学版),2012,28(5):11-13. 被引量:1
  • 10林丽美,周书明.(n,k)-排列图的条件连通度(英文)[J].数学研究,2012,45(4):350-364. 被引量:4

引证文献3

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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