Minimum Spanning Tree Based Network Design Using Prim’s and Kruskal’s Algorithms

M.L, Sanjhai

doi:https://doi.org/10.55041/ijcope.v2i3.228

Volume 02, Issue 04

Published on: April 2026

MINIMUM SPANNING TREE BASED NETWORK DESIGN USING PRIM’S AND KRUSKAL’S ALGORITHMS

Sanjhai M.L

Kamaraj College of Engineering and Technology Virudhunagar Tamilnadu India

DOI:https://doi.org/10.55041/ijcope.v2i3.228

Article Status

Plagiarism Passed Peer Reviewed Open Access

Available Documents

Download PDF Review Report

Abstract

Efficient network design plays a critical role in modern communication systems. The primary objective of network optimization is to connect multiple nodes with minimum cost while maintaining reliable connectivity. Graph theory provides effective methods for solving such problems using Minimum Spanning Tree (MST) algorithms. A Minimum Spanning Tree connects all vertices in a graph with the minimum possible total edge weight while avoiding cycles. This paper presents a comparative analysis of two widely used MST algorithms: Prim’s Algorithm and Kruskal’s Algorithm. The algorithms are implemented using Python and evaluated based on computational complexity and performance. Mathematical formulations, algorithmic analysis, and experimental results are presented to demonstrate their effectiveness in designing optimal communication networks such as campus networks and telecommunication infrastructure.

Keywords: Graph Theory, Minimum Spanning Tree, Prim’s Algorithm, Kruskal’s Algorithm, Network Optimization, Greedy Algorithms, Python

How to Cite this Paper

M.L, S. (2026). Minimum Spanning Tree Based Network Design Using Prim’s and Kruskal’s Algorithms. International Journal of Creative and Open Research in Engineering and Management, <i>02</i>(04). https://doi.org/10.55041/ijcope.v2i3.228

M.L, Sanjhai. "Minimum Spanning Tree Based Network Design Using Prim’s and Kruskal’s Algorithms." International Journal of Creative and Open Research in Engineering and Management, vol. 02, no. 04, 2026, pp. . doi:https://doi.org/10.55041/ijcope.v2i3.228.

M.L, Sanjhai. "Minimum Spanning Tree Based Network Design Using Prim’s and Kruskal’s Algorithms." International Journal of Creative and Open Research in Engineering and Management 02, no. 04 (2026). https://doi.org/https://doi.org/10.55041/ijcope.v2i3.228.

Search & Index

References

H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein,Introduction to Algorithms, Cambridge, MA, USA: MIT Press.

Kleinberg and É. Tardos, Algorithm Design, Boston, MA, USA: Pearson.

F. Kurose and K. W. Ross, Computer Networking: A Top-Down Approach, Boston, MA, USA: Pearson.

E. Tarjan, Data Structures and Network Algorithms, Philadelphia, PA, USA: SIAM.

K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications, Englewood Cliffs, NJ, USA: Prentice Hall.

B. West, Introduction to Graph Theory, Upper Saddle River, NJ, USA: Prentice Hall.

A. Bondy and U. S. R. Murty, Graph Theory with Applications, New York, NY, USA: Elsevier.

Diestel, Graph Theory, Berlin, Germany: Springer.

Even, Graph Algorithms, Cambridge, UK: Cambridge University Press.

J. Gross and J. Yellen, Graph Theory and Its Applications, Boca Raton, FL, USA: CRC Press

Ethical Compliance & Review Process

•All submissions are screened under plagiarism detection.
•Review follows editorial policy.
•Authors retain copyright.
•Peer Review Type: Double-Blind Peer Review
•Published on: Apr 02 2026

CCBYNC

This article is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. You are free to share and adapt this work for non-commercial purposes with proper attribution.

View License

Back to Volume 02, Issue 04 View All Issues Next Article

← Previous Article

Machine Learning-Based Phishing URL Detection System Using Feature Engineering and Classification Models

Next Article →

Navigating Crisis:The Influence of Epidemics and Natural Disasters on Tourism in Kerala