The Hamiltonian index of a graph

Liming Xiong

doi:10.1007/s003730170016

The Hamiltonian index of a graph

Liming Xiong^*

^*Corresponding author for this work

Jiangxi Normal University

Research output: Contribution to journal › Article › peer-review

8 Citations (Scopus)

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. Saražin [Discrete Math. 134(1994)85-91]. Nordhaus-Gaddum's inequalities for the hamiltonian index of a graph are also established.

Original language	English
Pages (from-to)	775-784
Number of pages	10
Journal	Graphs and Combinatorics
Volume	17
Issue number	4
DOIs	https://doi.org/10.1007/s003730170016
Publication status	Published - 2001
Externally published	Yes

Keywords

Diameter
Hamiltonian index
Nordhaus-Gaddum's inequality

Access to Document

10.1007/s003730170016

Cite this

Xiong, L. (2001). The Hamiltonian index of a graph. Graphs and Combinatorics, 17(4), 775-784. https://doi.org/10.1007/s003730170016

@article{ec950686dcce404db8c0d262c4b3f9ec,

title = "The Hamiltonian index of a graph",

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. Sara{\v z}in [Discrete Math. 134(1994)85-91]. Nordhaus-Gaddum's inequalities for the hamiltonian index of a graph are also established.",

keywords = "Diameter, Hamiltonian index, Nordhaus-Gaddum's inequality",

author = "Liming Xiong",

year = "2001",

doi = "10.1007/s003730170016",

language = "English",

volume = "17",

pages = "775--784",

journal = "Graphs and Combinatorics",

issn = "0911-0119",

publisher = "Springer Japan",

number = "4",

}

TY - JOUR

T1 - The Hamiltonian index of a graph

AU - Xiong, Liming

PY - 2001

Y1 - 2001

N2 - 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. Saražin [Discrete Math. 134(1994)85-91]. Nordhaus-Gaddum's inequalities for the hamiltonian index of a graph are also established.

AB - 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. Saražin [Discrete Math. 134(1994)85-91]. Nordhaus-Gaddum's inequalities for the hamiltonian index of a graph are also established.

KW - Diameter

KW - Hamiltonian index

KW - Nordhaus-Gaddum's inequality

UR - http://www.scopus.com/inward/record.url?scp=3142531873&partnerID=8YFLogxK

U2 - 10.1007/s003730170016

DO - 10.1007/s003730170016

M3 - Article

AN - SCOPUS:3142531873

SN - 0911-0119

VL - 17

SP - 775

EP - 784

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

IS - 4

ER -

The Hamiltonian index of a graph

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this