Disjoint Steiner Trees in the Balanced Complete Multipartite Networks

Yinkui Li, Yilin Song, Liqun Wei and Ma Xuanlong

Journal of Mathematics, 2024, vol. 2024, 1-9

Abstract: 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.

Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2024/6606412.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2024/6606412.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:6606412

DOI: 10.1155/2024/6606412

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().