Applications of graph theory in telecommunications network design and garbage collection route
Date of Publication
1999
Document Type
Bachelor's Thesis
Degree Name
Bachelor of Science in Mathematics
College
College of Science
Department/Unit
Mathematics and Statistics
Abstract/Summary
Most people are not aware that Mathematics, especially Graph Theory, can actually be applied to real life problems. This thesis presents two applications.
A telecommunications network for the Gardens of Maia Alta was designed using the Kruskal's Algorithm. The algorithm finds a minimal spanning tree for the graph. For easier implementation of the algorithm, a computer program was developed using Microsoft Visual Basic 5.0. The vertices of the graph represent the posts for the telephone lines and the edges represent the cables connecting each post.
This thesis also presents a garbage collection route for the said subdivision. The Repeating Edge Algorithm is first implemented to produce an eulerian graph. Fleury's Algorithm then traces an eulerian trail for the resulting graph. a computer program using Microsoft Visual Basic 5.0 is created to handle the large number of vertices. The vertices of the graph represent the intersections of the streets and the edges represent the streets.
Abstract Format
html
Language
English
Format
Accession Number
TU09235
Shelf Location
Archives, The Learning Commons, 12F, Henry Sy Sr. Hall
Physical Description
79 numb. leaves
Recommended Citation
Honrado, J. A., & Verdejo, J. C. (1999). Applications of graph theory in telecommunications network design and garbage collection route. Retrieved from https://animorepository.dlsu.edu.ph/etd_bachelors/16567
