The Hamiltonian index of a graph and its branchbonds
Xiong, L. and Broersma, H.J. and Li, X. (2001) The Hamiltonian index of a graph and its branchbonds. [Report]

PDF
176kB 
Abstract:  Let be an undirected and loopless finite graph that is not a path. The minimum such that the iterated line graph is hamiltonian is called the hamiltonian index of denoted by A reduction method to determine the hamiltonian index of a graph with is given here. With it we will establish a sharp lower bound and a sharp upper bound for , respectively, which improves some known results of P.A. Catlin et al. [J. Graph Theory 14 (1990)] and H.J. Lai [Discrete Mathematics 69 (1988)]. Examples show that may reach all integers between the lower bound and the upper bound.

Item Type:  Report 
Faculty:  Electrical Engineering, Mathematics and Computer Science (EEMCS) 
Research Group:  
Link to this item:  http://purl.utwente.nl/publications/65798 
Export this item as:  BibTeX EndNote HTML Citation Reference Manager 
Repository Staff Only: item control page
Metis ID: 203117