Disjoint Steiner Trees in the Balanced Complete Multipartite Networks
The generalized k-connectivity κkG of a graph G, introduced by Hager in 1985, is a natural generalization of the concept of connectivity κG, which is just for k=2. In (Basrah Journal of Science, 37(3) (2019), 430–441), authors discussed the problem of internally disjoint Steiner trees in an equally...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2024-01-01
|
| Series: | Journal of Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2024/6606412 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The generalized k-connectivity κkG of a graph G, introduced by Hager in 1985, is a natural generalization of the concept of connectivity κG, which is just for k=2. In (Basrah Journal of Science, 37(3) (2019), 430–441), authors discussed the problem of internally disjoint Steiner trees in an equally complete k-partite network G by determining its generalized 3-connectivity κ3G. In this paper, we by determining the exact value of the generalized 4, 5-(edge)-connectivity of the balanced complete n-partite graph Kmn to investigate the edge disjoint Steiner trees in the balanced complete n-partite networks. |
|---|---|
| ISSN: | 2314-4785 |