Some characterizations of Eulerian and Hamiltonian graphs
Date of Publication
2006
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Thesis Adviser
Rigor B. Ponsones
Defense Panel Member
Severino V. Gervacio
Wilson Cordova
Francis Joseph H. Campeña
Abstract/Summary
The thesis is an exposition of some characterization of Eulerian and Hamiltonian graphs. It discusses the definitions of an Eulerian graph, Hamiltonian graph and examples, a necessary and sufficient condition for a graph to be Eulerian, a necessary and sufficient condition for a graph to be edge-traceable, the Fleury's algorithms and its justification, and sufficient conditions for a graph to be Hamiltonian.
Abstract Format
html
Language
English
Format
Accession Number
TU13526
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
vi, 46, [16] leaves : ill.
Keywords
Eulerian graph theory
Recommended Citation
Andrada, P. Y., & Ong, H. L. (2006). Some characterizations of Eulerian and Hamiltonian graphs. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/17428
