We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
The Generalized Connectivity of Generalized Petersen Graph.
- Authors
Si, Yuan; Li, Ping; Xiao, Yuzhi; Liang, Jinxia
- Abstract
For a vertex set S of G , we use κ S (G) to denote the maximum number of edge-disjoint Steiner trees of G such that any two of such trees intersect in S. The generalized k -connectivity of G is defined as κ k (G) = min S ⊆ V (G) , | S | = k κ S (G). We get that for any generalized Petersen graph G = G P (n , k) with n ≥ k + 3 , κ t (G) = 1 when t ≥ 2 k + 5. We give the values of κ k (G) for Petersen graph G P (5 , 2) , where 3 ≤ k ≤ 1 0 , and the values of κ k (G) for generalized Petersen graph G P (n , 1) , where n ≥ 3 and 3 ≤ k ≤ 2 n.
- Subjects
PETERSEN graphs; STEINER systems
- Publication
Journal of Interconnection Networks, 2022, Vol 22, Issue 2, p1
- ISSN
0219-2659
- Publication type
Article
- DOI
10.1142/S0219265921500213