The generalized 3-connectivity of Cartesian product graphs

Abstract : 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.
Type de document :
Article dans une revue
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2012, Vol. 14 no. 1 (1), pp.43-54
Liste complète des métadonnées

Littérature citée [14 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00990569
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Soumis le : mardi 13 mai 2014 - 16:19:43
Dernière modification le : jeudi 28 septembre 2017 - 22:08:02
Document(s) archivé(s) le : lundi 10 avril 2017 - 22:40:35

Fichier

1850-6826-2-PB.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00990569, version 1

Collections

Citation

Hengzhe Li, Xueliang Li, Yuefang Sun. The generalized 3-connectivity of Cartesian product graphs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2012, Vol. 14 no. 1 (1), pp.43-54. 〈hal-00990569〉

Partager

Métriques

Consultations de la notice

63

Téléchargements de fichiers

248