Skip to Main Content
Skip Nav Destination
ASME Press Select Proceedings

International Conference on Computer and Electrical Engineering 4th (ICCEE 2011)

By
Jianhong Zhou
Jianhong Zhou
Search for other works by this author on:
ISBN:
9780791859841
No. of Pages:
698
Publisher:
ASME Press
Publication date:
2011

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...

Abstract
Key Words
1. Introduction
2. Assumptions and Notation
3. Labeling Scheme for Nodes and Edges
4. Reliability Function
5. Reliability Bounds
References
This content is only available via PDF.
You do not currently have access to this chapter.
Close Modal

or Create an Account

Close Modal
Close Modal