On suficient conditions involving distances for hamiltonian properties in graphs
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.
|Date of creation:||Jun 2013|
|Contact details of provider:|| Postal: Campus de Schoelcher, B.P. 7209, 97275 Schoelcher Cedex|
Web page: http://www.ceregmia.eu/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:crg:wpaper:dt2013-13. See general 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 you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.