Copyright © 2025 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{167311,
        author = {Moulya S and Dr.Latha B M and H S Saraswathi and Tanzila F Mallapur and Sanjana D and Hemalatha K S and Asha N S},
        title = {FROM THEORY TO PRACTICE: APPLICATIONS OF KRUSKAL’S ALGORITHM FOR MINIMUM SPANNING TREES},
        journal = {International Journal of Innovative Research in Technology},
        year = {2024},
        volume = {11},
        number = {3},
        pages = {925-929},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=167311},
        abstract = {This study investigates the application of graph theory in computer network management utilizing the Kruskal algorithm. The goal is to enhance resource efficiency, decrease latency, and boost network throughput. The initial step involves modelling a computer network as an undirected weighted graph, where nodes represent network devices and edges symbolize the connections between these devices. The Kruskal algorithm is employed to identify the optimal connections by minimizing resource usage costs. The findings indicate that applying graph theory and the Kruskal algorithm can significantly enhance the performance and reliability of computer networks. The research process includes identifying network components, constructing graphs, sorting edges by weight, and initializing Union-Find data structures to prevent cycles. Testing with both simulated and real-world data confirms that a more resilient and redundant network structure can be created. This study offers new insights into efficient and reliable computer network management, supporting the advancement of future network technologies.},
        keywords = {Kruskal Algorithm, Computer Network Modelling, Graph Theory.},
        month = {August},
        }