The existence and upper bound for two types of restricted connectivity Original Research Article

In this paper, we study two types of restricted connectivity: image is the cardinality of a minimum vertex cut image such that every component of image has at least image vertices; image is the cardinality of a minimum vertex cut image such that there are at least two components in image of order at least image. In this paper, we give some sufficient conditions for the existence and upper bound of image and/or image, and study some properties of these two parameters.