A computer based approach in determining the Hamiltonian cycle of a graph
This thesis introduces to the readers the basic characteristics of Hamiltonian cycles. Hamiltonian cycles did not enjoy the same success as that of other graphs, such as Eulerian cycles, since mathematicians have not yet found a general criterion that would suggest the existence of such a cycle in a...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
1993
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/16109 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| Summary: | This thesis introduces to the readers the basic characteristics of Hamiltonian cycles. Hamiltonian cycles did not enjoy the same success as that of other graphs, such as Eulerian cycles, since mathematicians have not yet found a general criterion that would suggest the existence of such a cycle in a graph. Because of this, finding a Hamiltonian cycle in a graph may consume a great deal of time. Hence this thesis developed a software package which determines the existence of Hamiltonian cycles in a given graph.The theorems that were gathered are just sufficient conditions. This study does not aim to find a sufficient and necessary condition for the existence of a Hamiltonian cycle, but to provide the readers with an easier way of determining the Hamiltonian cycles of a graph, if there are any. It also aims to interest the readers in pursuing further study of Hamiltonian cycles. |
|---|