Edge bounds in nonhamiltonian image-connected graphs Original Research Article

Let G be a k-connected graph of order n with image. Then for (image, image), (image, image), and image, image, image is hamiltonian. The bounds are tight and for image, (image, image), and (image, image) the extremal graphs are unique. A general bound will also be given for the number of edges in a nonhamiltonian k-connected graph, but the bound is not tight.