Abstract
AbstractWe prove that a k‐connected graph of order n, such that the number of neighbors of every independent set of k vertices is greater than (k(n – 1))/(k + 1) is hamiltonian.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have