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!
|
| _version_ | 1832544233663234048 |
|---|---|
| author | Yinkui Li Yilin Song Liqun Wei |
| author_facet | Yinkui Li Yilin Song Liqun Wei |
| author_sort | Yinkui Li |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-e297ed1303814fc78470c891dd1823cc |
| institution | Kabale University |
| issn | 2314-4785 |
| language | English |
| publishDate | 2024-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Mathematics |
| spelling | doaj-art-e297ed1303814fc78470c891dd1823cc2025-02-03T10:53:47ZengWileyJournal of Mathematics2314-47852024-01-01202410.1155/2024/6606412Disjoint Steiner Trees in the Balanced Complete Multipartite NetworksYinkui Li0Yilin Song1Liqun Wei2Department of MathematicsDepartment of MathematicsDepartment of MathematicsThe 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.http://dx.doi.org/10.1155/2024/6606412 |
| spellingShingle | Yinkui Li Yilin Song Liqun Wei Disjoint Steiner Trees in the Balanced Complete Multipartite Networks Journal of Mathematics |
| title | Disjoint Steiner Trees in the Balanced Complete Multipartite Networks |
| title_full | Disjoint Steiner Trees in the Balanced Complete Multipartite Networks |
| title_fullStr | Disjoint Steiner Trees in the Balanced Complete Multipartite Networks |
| title_full_unstemmed | Disjoint Steiner Trees in the Balanced Complete Multipartite Networks |
| title_short | Disjoint Steiner Trees in the Balanced Complete Multipartite Networks |
| title_sort | disjoint steiner trees in the balanced complete multipartite networks |
| url | http://dx.doi.org/10.1155/2024/6606412 |
| work_keys_str_mv | AT yinkuili disjointsteinertreesinthebalancedcompletemultipartitenetworks AT yilinsong disjointsteinertreesinthebalancedcompletemultipartitenetworks AT liqunwei disjointsteinertreesinthebalancedcompletemultipartitenetworks |