科研之友
微信
新浪微博
Facebook
分享链接
摘要
Let G = (V, E) be a connected graph. G is super-lambda if every minimum edge cut of G isolates a vertex. Moreover, An edge set S subset of E is a restricted edge cut of G if G - S is disconnected and every component of G - S has at least 2 vertices. The restricted edge connectivity of G, denoted by lambda' (G), is the minimum cardinality of all restricted edge cuts. Let xi(G) = min{d(G)(u) + d(G)(v) - 2 : uv is an element of E(G)} we say G is lambda'-optimal if lambda'(G) = xi(G). In this paper, we give a sufficient condition for bipartite graphs to be both super-lambda and lambda'-optimal.
- 出版日期2014-10
- 单位新疆大学
