Home / Regular Issue / JTAS Vol. 12 (1) Apr. 1989 / PERT-0533-1989
On the Higher Order Edge-Connectivity of Complete Multipartite Graphs
Y.H. Peng, C.C. Chen and K.M. Koh
Pertanika Journal of Tropical Agricultural Science, Volume 12, Issue 1, April 1989
Keywords: kth order edge-connectivity; efficient k-separation; complete multipartite graph; edge-toughness.
Published on:
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
ISSN 1511-3701
e-ISSN 2231-8542
Share this article
Recent Articles
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License .