On the connectivity and superconnected graphs with small diameter Original Research Article

In this paper, first we prove that any graph image is 2-connected if image for even girth image, and for odd girth image and maximum degree image where image is the minimum degree. Moreover, we prove that any graph image of diameter image satisfies that (i) image is 5-connected for even girth image and image, and (ii) image is super-image for odd girth image and image.