期刊名称：Pertanika Journal of Social Sciences & Humanities
印刷版ISSN：0128-7702
电子版ISSN：2231-8534
出版年度：1989
卷号：12
期号：1
出版社：Universiti Putra Malaysia
摘要：Lei G be a connected graph with p> 2 vertices. For k = 7, 2,..., p - 1, the kh order edge-connectivity of G, denoted by X(K> (G), is defined to be the smallest number of edges whose removal from G leaves a graph with k + 1 connected components. In this note we determine X
关键词：kth order edge-connectivity; efficient k-separation; complete multipartite graph; edge-toughness.
