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...
| 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 |
| _version_ | 1825921524053311488 |
|---|---|
| author | Peng, Y. H. Chen, C. C. Koh, K. M. |
| author_facet | Peng, Y. H. Chen, C. C. Koh, K. M. |
| author_sort | Peng, Y. H. |
| collection | UPM |
| description | 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. |
| first_indexed | 2024-03-06T06:59:09Z |
| format | Article |
| id | upm.eprints-2765 |
| institution | Universiti Putra Malaysia |
| language | English English |
| last_indexed | 2024-03-06T06:59:09Z |
| publishDate | 1989 |
| record_format | dspace |
| spelling | upm.eprints-27652013-05-27T07:03:20Z http://psasir.upm.edu.my/id/eprint/2765/ On the Higher Order Edge-Connectivity of Complete Multipartite Graphs Peng, Y. H. Chen, C. C. Koh, K. M. 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. 1989 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/2765/1/On_the_Higher_Order_Edge-Connectivity_of.pdf 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. English |
| spellingShingle | Peng, Y. H. Chen, C. C. Koh, K. M. On the Higher Order Edge-Connectivity of Complete Multipartite Graphs |
| title | On the Higher Order Edge-Connectivity of Complete Multipartite Graphs |
| title_full | On the Higher Order Edge-Connectivity of Complete Multipartite Graphs |
| title_fullStr | On the Higher Order Edge-Connectivity of Complete Multipartite Graphs |
| title_full_unstemmed | On the Higher Order Edge-Connectivity of Complete Multipartite Graphs |
| title_short | On the Higher Order Edge-Connectivity of Complete Multipartite Graphs |
| title_sort | on the higher order edge connectivity of complete multipartite graphs |
| url | http://psasir.upm.edu.my/id/eprint/2765/1/On_the_Higher_Order_Edge-Connectivity_of.pdf |
| work_keys_str_mv | AT pengyh onthehigherorderedgeconnectivityofcompletemultipartitegraphs AT chencc onthehigherorderedgeconnectivityofcompletemultipartitegraphs AT kohkm onthehigherorderedgeconnectivityofcompletemultipartitegraphs |