On the Higher Order Edge-Connectivity of Complete Multipartite Graphs

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.

[img] PDF
2290Kb

Abstract

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.

Item Type:Article
Keyword:kth order edge-connectivity, efficient k-separation, complete multipartite graph, edge-toughness
ID Code:2765
Deposited By: Nur Izzati Mohd Zaki
Deposited On:17 Nov 2009 06:16
Last Modified:27 May 2013 07:03

Repository Staff Only: Edit item detail

Document Download Statistics

This item has been downloaded for since 17 Nov 2009 06:16.

View statistics for "On the Higher Order Edge-Connectivity of Complete Multipartite Graphs"


Universiti Putra Malaysia Institutional Repository

Universiti Putra Malaysia Institutional Repository is an on-line digital archive that serves as a central collection and storage of scientific information and research at the Universiti Putra Malaysia.

Currently, the collections deposited in the IR consists of Master and PhD theses, Master and PhD Project Report, Journal Articles, Journal Bulletins, Conference Papers, UPM News, Newspaper Cuttings, Patents and Inaugural Lectures.

As the policy of the university does not permit users to view thesis in full text, access is only given to the first 24 pages only.