Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Mathematics
The Hamiltonian Index Of Graphs, Zhi-Hong Chen, Yi Hong, Jian-Liang Lin, Zhi-Sui Tao
The Hamiltonian Index Of Graphs, Zhi-Hong Chen, Yi Hong, Jian-Liang Lin, Zhi-Sui Tao
Zhi-Hong Chen
The Hamiltonian index of a graph GG is defined as h(G)=min{m:Lm(G) is Hamiltonian}.h(G)=min{m:Lm(G) is Hamiltonian}. In this paper, using the reduction method of Catlin [P.A. Catlin, A reduction method to find spanning Eulerian subgraphs, J. Graph Theory 12 (1988) 29–44], we constructed a graph sourceH̃^(m)(G) from GG and prove that if h(G)≥2h(G)≥2, then h(G) = min{m : H̃^(m)(G) has a spanning Eulerian subgraph}.