Robustness study in closed social networks using spanning tree approach

The mathematical framework of networks is well suited to describe several systems consisting of a large number of entities interacting with each others. Every entity is represented by a network node and each interaction by a link between two nodes. It is therefore possible to model these networks as graphs. In this paper, we present a reliability study for chain topologies based on spanning tree in a social network considered as graph. Our approach consist on finding a general formulae that compute complexities in some special closed networks, which represent an important measure of robustness and reliability, then we compare which topology can be adopted for a more reliable routing.