摘要
图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