On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks

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.