Spanning tree approach in all-terminal network reliability expansion

摘要

A method is presented to maximize the reliability improvement of a communication network through a new edge addition between an existing node pair of the network. The method does not require the numerical reliability functions for determining such a node pair. The node pairs are compared by the number of spanning trees generated as a result of the connection of an additional link, and then the node pair connection, which results in generating the largest number of spanning trees, is determined. The counting process for the number of spanning trees of the expanded network is based on the degree matrix (DM) of the network.