Superconnectivity of graphs with odd girth image and even girth image Original Research Article

A maximally connected graph of minimum degree image is said to be superconnected (for short super-image) if all disconnecting sets of cardinality image are the neighborhood of some vertex of degree image. Sufficient conditions on the diameter to guarantee that a graph of odd girth image and even girth image is super-image are stated. Also polarity graphs are shown to be super-image.