Generalized Measures of Fault Tolerance with Application to N-Cube Networks
IEEE Transactions on Computers
Conditional Connectivity Measures for Large Multiprocessor Systems
IEEE Transactions on Computers
On reliability of the folded hypercubes
Information Sciences: an International Journal
Note: Perfect matchings extend to Hamilton cycles in hypercubes
Journal of Combinatorial Theory Series B
| Hi-index | 0.04 |
In this note, we show that a subgraph induced by m (denote m by @?"i"="0^s2^t^"^i, t"0=[log"2m] and t"i=[log"2(m-@?"r"="0^i^-^12^t^"^r)] for i=1) vertices of an n-dimensional hypercube has at most @?"i"="0^st"i2^t^"^i^-^1+@?"i"="0^si@?2^t^"^i edges. As an application, we determine the m-extra edge-connectivity of hypercubes for m@?2^[^n^2^].