Abstract:
The subject of this thesis is the Hamiltonian Cycle problem, which is of interest in many areas including graph theory, algorithm design, and computational complexity. Named after the famous Irish mathematician Sir William Rowan Hamilton, a Hamiltonian Cycle within a graph is a simple cycle that passes through each vertex exactly once. Thegoalofourthesiswastofindformulaforagraphtobehamiltonian. Thereis alreadyaformulageneratedforatwocrossovergraphtobehamiltonian. Wearetrying to find a condition for three cross over graph to be hamiltonian. First of this thesis provides scope and some literature reviews. The second gives preliminaries and sufficent condition for hamiltonicity. And the third gives some new condition of hamiltonian graph.
Description:
We are thankful to Almighty Allah for his blessings for the successful completion of our thesis. Our heartiest gratitude, profound indebtedness and deep respect go to our supervisor, Mohammad Kaykobad, Professor, Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Dhaka-1000, Bangladesh,, for his constant supervision, affectionate guidance and great encouragement and motivation. His keen interest on the topic and valuable advices throughout the study was of great help in completing thesis.
We are especially grateful to the Department of Computer Science and Engineering (CSE) of Military Institute of Science and Technology (MIST) for providing their all out support during the thesis work.
Finally, we would like to thank our families and our course mates for their appreciable assistance, patience and suggestions during the course of our thesis.
