| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4632680 | Applied Mathematics and Computation | 2010 | 6 Pages |
Abstract
It is shown in this work that all n-dimensional hypercube networks for n ⩾ 4 are maximally 3-restricted edge connected. Employing this observation, we analyze the reliability of hypercube networks and determine the first 3n − 5 coefficients of the reliability polynomial of n-cube networks.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Jianping Ou,