Skip to main content
Springer Nature Link
Log in

The Hamiltonian Index of a Graph

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

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.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Mathematics, Jiangxi Normal University, Nanchang 330027, P.R. China e-mail: Liming_xiong@hotmail.com, , , , , , CN

    Liming Xiong

Authors
  1. Liming Xiong
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

Received: July 17, 1998 Final version received: September 13, 1999

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s003730170016