Nakudin

Application of Graph Theory to Network and Routing Problems

Mathematics2025, 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.

Ad slot

Preview — first 10 pages

Report a problem with this project

Nakudin uses cookies to serve ads, including personalized ads based on your visits to this and other sites. See our Privacy Policy for details.