On the Higher Order Edge-Connectivity of Complete Multipartite Graphs

• Main Authors: Peng, Y. H., Chen, C. C., Koh, K. M.
• 格式: Article
• 語言: English; English
• 出版: 1989
• 在線閱讀: http://psasir.upm.edu.my/id/eprint/2765/1/On_the_Higher_Order_Edge-Connectivity_of.pdf; http://psasir.upm.edu.my/id/eprint/2765/

Let G be a connected graph with p ≥ 2 vertices. For k = 1, 2, ..., P-1, the Kth order edge-connectivity of G, denoted by A(K} (e), is defined to be the smallest number of edges whose removal from e leaves a graph with k + 1 connected components. In this note we determine A(K} (e) for any complete...