Sufficient conditions for restricted-edge-connectivity to be optimal |
| |
| Authors: | Zhao Zhang |
| |
| Institution: | a College of Mathematics and System Sciences, Xinjiang University, Urmuqi, Xinjiang 830046, People's Republic of China
b Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, People's Republic of China |
| |
| Abstract: | For a connected graph G=(V,E), an edge set S⊂E is a k-restricted-edge-cut if G-S is disconnected and every component of G-S has at least k vertices. The cardinality of a minimum k-restricted-edge-cut is the k-restricted-edge-connectivity of G, denoted by λk(G). In this paper, we study sufficient conditions for λk(G) to be optimal, especially when k=2 and 3. |
| |
| Keywords: | Restricted-edge-connectivity |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
