首页 | 本学科首页   官方微博 | 高级检索  
     

二部图2-等周边连通度最优的充分条件
引用本文:段晋芳,原军. 二部图2-等周边连通度最优的充分条件[J]. 太原重型机械学院学报, 2010, 0(4): 309-311
作者姓名:段晋芳  原军
作者单位:太原科技大学应用科学学院,太原030024
基金项目:山西省自然科学基金(2008011013)
摘    要:图G的k-等周边连通度是图的边连通度概念的推广。通过考虑无向图等周边连通度与不相邻顶点对邻域之间的关系,给出了二部图的2-等周边连通度最优的充分条件。

关 键 词:边连通度  k-等周边连通度

A Sufficient Condition for the Optimum 2-Isoperimetric-Edge-Connectivity of a Bipartite Graph
DUAN Jin-fang,YUAN Jun. A Sufficient Condition for the Optimum 2-Isoperimetric-Edge-Connectivity of a Bipartite Graph[J]. Journal of Taiyuan Heavy Machinery Institute, 2010, 0(4): 309-311
Authors:DUAN Jin-fang  YUAN Jun
Affiliation:(School of Applied Sciences,Taiyuan University of Science and Technology,Taiyuan 030024,China)
Abstract: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.
Keywords:edge connectivity  k-restricted edge connectivity
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号