1 research outputs found
Two bounds for generalized -connectivity of Cartesian product graphs
The generalized -connectivity of a graph , which was
introduced by Chartrand et al.(1984) is a generalization of the concept of
vertex connectivity. Let and be nontrivial connected graphs. Recently,
Li et al. gave a lower bound for the generalized -connectivity of the
Cartesian product graph and proposed a conjecture for the case
that is -connected. In this paper, we give two different forms of lower
bounds for the generalized -connectivity of Cartesian product graphs. The
first lower bound is stronger than theirs, and the second confirms their
conjecture