Application of Graph Theory to Network and Routing Problems
Mathematics — 2025, Undergraduate
This study applied graph theory to network and routing problems. Road and communication networks were modelled as weighted graphs, and shortest-path and connectivity analyses were performed. The findings revealed that graph algorithms identified optimal routes and critical links efficiently, while network robustness was expressed through connectivity measures. The study observed that edge weights materially affected recommendations. It recommends graph-based modelling as a foundational tool for network design and logistics.
Report a problem with this project
More from Mathematics
- Input-Output Analysis of Regional Economies
- Graph Colouring Bounds for Scheduling Problems
- Computational Geometry of Non-Overlapping Packings
- Continuity and Fixed Points in Ordered Metric Spaces
- Fractional Calculus Models of Viscoelastic Material Response
Too time-strapped to build it yourself?
Our team writes final-year projects and builds software on request — source, materials and support included. Get a quote.