Lower connectivities of regular graphs with small diameter (Q878612)

A graph is called \(d\)-regular if all its vertices have the same degree \(d\). Lower bounds of the connectivities of a \(d\)-regular graph are established with given bounds on the diameter \(D\) in terms of the girth \(g\) of the graph. The authors show that a graph is 2-connected whenever \(D\leq g\), and it is 4-connected if \(D\leq g-1\). Some examples for particular values of the girth and the regularity are presented to show that the results are best possible.