On suficient conditions involving distances for hamiltonian properties in graphs
Ahmed Ainouche ()
Additional contact information
Ahmed Ainouche: UAG - CEREGMIA,Campus de Schoelcher B.P. 7209, 97275 Schoelcher Cedex Martinique (FRANCE)
No 2013-13, Documents de Travail from CEREGMIA, Université des Antilles et de la Guyane
Abstract:
Let 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 = f 1 2 3g we de…ne min max to be respectively the smallest, the second smallest and the largest value in f 12 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.
Pages: 12 pages
Date: 2013-06
References: View complete reference list from CitEc
Citations:
Downloads: (external link)
http://www2.univ-ag.fr/RePEc/DT/DT2013-13_Ainouche.pdf First version, 2013 (application/pdf)
Our link check indicates that this URL is bad, the error code is: 404 Not Found
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:crg:wpaper:dt2013-13
Access Statistics for this paper
More papers in Documents de Travail from CEREGMIA, Université des Antilles et de la Guyane Contact information at EDIRC.
Bibliographic data for series maintained by Janis Hilaricus ().