Abstract.
It is proved that the hamiltonian index of a connected graph other than a path is less than its diameter which improves the results of P. A. Catlin etc. [J. Graph Theory 14 (1990) 347–364] and M. L. Sarazin [Discrete Math. 134(1994)85–91]. Nordhaus-Gaddum's inequalities for the hamiltonian index of a graph are also established.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: July 17, 1998 Final version received: September 13, 1999
Rights and permissions
About this article
Cite this article
Xiong, L. The Hamiltonian Index of a Graph. Graphs Comb 17, 775–784 (2001). https://doi.org/10.1007/s003730170016
Issue Date:
DOI: https://doi.org/10.1007/s003730170016