Network reliability as a result of redundant connectivity
Thesis (MSc (Logistics)--University of Stellenbosch, 2007. === There exists, for any connected graph G, a minimum set of vertices that, when removed, disconnects G. Such a set of vertices is known as a minimum cut-set, the cardinality of which is known as the connectivity number k(G) of G. A conne...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en |
| Published: |
Stellenbosch : University of Stellenbosch
2007
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10019.1/1906 |