Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8900618 | Applied Mathematics and Computation | 2018 | 9 Pages |
Abstract
The generalized k-connectivity κk(G) of a graph G, which was introduced by Chartrand et al. (1984) is a generalization of the concept of vertex connectivity. Let G and H be nontrivial connected graphs. Recently, Li et al. (2012) gave a lower bound for the generalized 3-connectivity of the Cartesian product graph Gâ¡H and proposed a conjecture for the case that H is 3-connected. In this paper, we give two different forms of lower bounds for the generalized 3-connectivity of Cartesian product graphs. The first lower bound is stronger than theirs, and the second confirms their conjecture.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Hui Gao, Benjian Lv, Kaishun Wang,