Hamiltonian graphs involving neighborhood intersections (Q1210568)

Let \(G\) be a graph of order \(n\) and \(\alpha\) the independence number of \(G\). It is shown that if \(G\) is a 2-connected graph and \(\max\bigl\{ d(u),d(v)\bigr\}\geq{n\over 2}\) for each pair of non-adjacent vertices \(u\) and \(v\) with \(1\leq | N(u)\cap N(v)|\leq\alpha-1\), then \(G\) is Hamiltonian. This result generalizes Fan's result in which the condition is on any pair of vertices with distance 2. Since Fan's condition has been used and developed in various published papers, we may hope that the condition here with the constraint on the pair of vertices could also be developed in the future.