On suficient conditions involving distances for hamiltonian properties in graphs
AbstractLet G be a 2-connected graph of order A set is essential if it is independent and contains two vertices at distance two apart. For = f1 2 3g we de…ne min max to be respectively the smallest, the second smallest and the largest value in f12 23 31g where = j() \ ( )j In this paper we show that the closure concept can be used to prove su¢cient conditions on hamiltonicity when distances are involved. As main results, we prove for instance that if either (i) each essential triple of satis…es the condition 2 () ¸ + or (ii) j() [ ()j + min f() ()g ¸ for all pairs of ( ) at distance two then its 0-dual closure is complete. By allowing classes of nonhamiltonian graphs we extend this result by one unit. A large number of new su¢cient conditions are derived. The proofs are short and all the results are sharp. Key words: Hamiltonian graph, closure, dual closure, neighborhood closure, essential sets.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by CEREGMIA, Université des Antilles et de la Guyane in its series Documents de Travail with number 2013-13.
Length: 12 pages
Date of creation: Jun 2013
Date of revision:
Contact details of provider:
Postal: Campus de Schoelcher, B.P. 7209, 97275 Schoelcher Cedex
Web page: http://www.ceregmia.eu/
More information through EDIRC
This paper has been announced in the following NEP Reports:
- NEP-ALL-2013-06-16 (All new papers)
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Janis Hilaricus).
If references are entirely missing, you can add them using this form.