International Conference on Computer and Electrical Engineering 4th (ICCEE 2011)
27 Reliability of Saturated Networks
A saturated network is one wherein each node is connected to every other node by an edge. Its structure is the same when viewed from any of its nodes. Because of this symmetry, its matrix representation and cut sets and paths generation become relatively simpler. The reliability and unreliability functions have been found to follow definite patterns to some extent. Such knowledge of saturated networks can be used to obtain relevant quantities for any network as it will always be some sub network of a saturated network having the same number of nodes. An example illustrating this feature has been...