The generalized 3-connectivity of Cartesian product

From MaRDI portal




Abstract: The generalized connectivity of a graph, which was introduced recently by Chartrand et al., is a generalization of the concept of vertex connectivity. Let S be a nonempty set of vertices of G, a collection T1,T2,...,Tr of trees in G is said to be internally disjoint trees connecting S if E(Ti)capE(Tj)=emptyset and V(Ti)capV(Tj)=S for any pair of distinct integers i,j, where 1leqi,jleqr. For an integer k with 2leqkleqn, the k-connectivity kappak(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, kappa2(G)=kappa(G) is the connectivity of G. Sabidussi showed that kappa(GBoxH)geqkappa(G)+kappa(H) for any two connected graphs G and H. In this paper, we first study the 3-connectivity of the Cartesian product of a graph G and a tree T, and show that (i) if kappa3(G)=kappa(G)geq1, then kappa3(GBoxT)geqkappa3(G); (ii) if 1leqkappa3(G)<kappa(G), then kappa3(GBoxT)geqkappa3(G)+1. Furthermore, for any two connected graphs G and H with kappa3(G)geqkappa3(H), if kappa(G)>kappa3(G), then kappa3(GBoxH)geqkappa3(G)+kappa3(H); if kappa(G)=kappa3(G), then kappa3(GBoxH)geqkappa3(G)+kappa3(H)1. Our result could be seen as a generalization of Sabidussi's result. Moreover, all the bounds are sharp.




Cited in
(45)






This page was built for publication: The generalized 3-connectivity of Cartesian product

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5403014)