Peng, Y. H. and Chen, C. C. and Koh, K. M. (1989) On the Higher Order Edge-Connectivity of Complete Multipartite Graphs. Pertanika, 12 (1). pp. 83-88.
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 multi partite graph G as a consequence, we give a necessary and sufficient condition for the graph Gn to be factored into spanning trees.
|Keyword:||kth order edge-connectivity, efficient k-separation, complete multipartite graph, edge-toughness|
|Deposited By:||Nur Izzati Mohd Zaki|
|Deposited On:||17 Nov 2009 14:16|
|Last Modified:||28 Jul 2010 12:11|
Repository Staff Only: item control page