A simple upper bound for the hamiltonian index of a graph Original Research Article

Let G be a connected graph other than a path and ham (G),Δ (G) be its hamiltonian index and maximal degree, respectively. It is proved that ham (G)⩽|(G|-Δ (G).