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: | Yinkui Li, Yilin Song, Liqun Wei |
---|---|
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!
|
Similar Items
-
Decompositions of Circulant-Balanced Complete Multipartite Graphs Based on a Novel Labelling Approach
by: A. El-Mesady, et al.
Published: (2022-01-01) -
Extremal Matching Energy and the Largest Matching Root of Complete Multipartite Graphs
by: Xiaolin Chen, et al.
Published: (2019-01-01) -
Some Conclusion on Unique k-List Colorable Complete Multipartite Graphs
by: Yanning Wang, et al.
Published: (2013-01-01) -
Multipartite entanglement distribution in a topological photonic network
by: Juan Zurita, et al.
Published: (2025-02-01) -
The Structure of Disjoint Groups of Continuous Functions
by: Hojjat Farzadfard, et al.
Published: (2012-01-01)