On the Higher Order Edge-Connectivity of Complete Multipartite Graphs
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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English English |
| Published: |
1989
|
| Online Access: | 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/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|