The generalized 3-connectivity of Cartesian product graphs
Authors: Hengzhe Li ^{1}; Xueliang Li ^{1}; Yuefang Sun ^{1}
NULL##NULL##NULL
Hengzhe Li;Xueliang Li;Yuefang Sun
1 Center for Combinatorics [Nankai]
The generalized connectivity of a graph, which was introduced by Chartrand et al. in 1984, is a generalization of the concept of vertex connectivity. Let S be a nonempty set of vertices of G, a collection \T-1, T (2), ... , T-r\ of trees in G is said to be internally disjoint trees connecting S if E(T-i) boolean AND E(T-j) - empty set and V (T-i) boolean AND V(T-j) = S for any pair of distinct integers i, j, where 1 <= i, j <= r. For an integer k with 2 <= k <= n, the k-connectivity kappa(k) (G) of G is the greatest positive integer r for which G contains at least r internally disjoint trees connecting S for any set S of k vertices of G. Obviously, kappa(2)(G) = kappa(G) is the connectivity of G. Sabidussi's Theorem showed that kappa(G square H) >= kappa(G) + kappa(H) for any two connected graphs G and H. In this paper, we prove that for any two connected graphs G and H with kappa(3) (G) >= kappa(3) (H), if kappa(G) > kappa(3) (G), then kappa(3) (G square H) >= kappa(3) (G) + kappa(3) (H); if kappa(G) = kappa(3)(G), then kappa(3)(G square H) >= kappa(3)(G) + kappa(3) (H) - 1. Our result could be seen as an extension of Sabidussi's Theorem. Moreover, all the bounds are sharp.
Graphs with given group and given graph-theoretical properties
2 Documents citing this article
Source : OpenCitations
Ge, Huifen; Zhang, Shumin; Ye, Chengfu; Hao, Rongxia, 2022, The Generalized 4-Connectivity Of Folded Petersen Cube Networks, AIMS Mathematics, 7, 8, pp. 14718-14737, 10.3934/math.2022809.
Wang, Junzhen; Zou, Jinyu; Zhang, Shumin, 2022, Generalized 4-Connectivity Of Hierarchical Star Networks, Open Mathematics, 20, 1, pp. 1261-1275, 10.1515/math-2022-0490.