Superconnectivity of regular graphs with small diameter Original Research Article

A graph is superconnected, for short super-image, if all minimum vertex-cuts consist of the vertices adjacent with one vertex. In this paper we prove for any image-regular graph of diameter image and odd girth image that if image, then the graph is super-image when image and a complete graph otherwise.