One sufficient condition for Hamiltonian graphs involving distances
\textit{Ø. Ore} [Am. Math. Mon. 67, 55 (1960; Zbl 0089.39505)] established the well-known degree condition which states that if the degree sum of every pair of non-adjacent vertices in an \(n\)-vertex graph \(G\) is at least \(n\), then \(G\) is Hamiltonian. In 1990 \textit{G. T. Chen} [J. Graph Theory 14, No. 4, 501--508 (1990; Zbl 0721.05043)] showed that if \(2|N(u) \cup N(v)| + deg(u) + deg(v) \geq 2n-1\) for all pairs of non-adjacent vertices in a \(2\)-connected graph of order \(n\), then the graph is Hamiltonian. In the paper under review, it is shown that if this condition holds for all pairs of vertices distance 2 apart (in a \(2\)-connected graph of order \(n\)), then the graph is also Hamiltonian.
This page was built for publication: One sufficient condition for Hamiltonian graphs involving distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1759263)
