Two Sufficient Conditions for Hamilton and Dominating Cycles

Zh. G. Nikoghosyan

International Journal of Mathematics and Mathematical Sciences, 2012, vol. 2012, 1-25

Abstract:

We prove that if is a 2-connect graph of size (the number of edges) and minimum degree with , where when and when , then each longest cycle in is a dominating cycle. The exact analog of this theorem for Hamilton cycles follows easily from two known results according to Dirac and Nash-Williams: each graph with is hamiltonian. Both results are sharp in all respects.

Date: 2012
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2012/185346.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2012/185346.xml (text/xml)

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:hin:jijmms:185346

DOI: 10.1155/2012/185346

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().