The neighborhood union of independent sets and hamiltonicity of graphs Original Research Article

Let G be a graph, image the neighborhood of image for each image, and image for each image. For any two positive integers s and t, we prove that there exists a least positive integer image such that every image-connected graph G of order image is hamiltonian if image for every two disjoint independent vertex sets S, T with image and image.