In networking, broadcasting is also done from a single source to all other sources. The minimum cost of the broadcasting is usually derived using a minimum weighted spanning tree. If a fault occurs at nodes or edges the message will not reach the destination. Fault occurrence cannot be predicted and may occur at any point in near future. In this paper we use vertex connectivity and edge connectivity of a graph for deciding a suitable minimum weighted spanning tree in case of fault occurrence. © 2016, International Journal of Pharmacy and Technology. All rights reserved.