A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph

Minimal Spanning Tree (MST) problem in an arbitrary undirected graph is an important problem in graph theory and has extensive applications. Numerous algorithms are available to compute an MST. Our purpose here is to propose a self-stabilizing distributed algorithm for the MST problem and to prove its correctness. The algorithm utilizes an interesting result of [1]. We show the correctness of the proposed algorithm by using a new technique involving induction.