![hypercube in mathematica hypercube in mathematica](https://mir-s3-cdn-cf.behance.net/project_modules/max_1200/ca5f4b52333307.590cb5181780a.jpg)
Acta mathematica scientia,Series B, 2006, 26(2): 246 ASYMPTOTIC BEHAVIOR FOR COMMUTATIVE SEMIGROUPS OF ALMOST ASYMPTOTICALLY NONEXPANSIVE TYPE MAPPINGS. Acta mathematica scientia,Series B, 2006, 26(4): 639 AN ESTIMATE ON THE DISTRIBUTION AND MOMENTS OF THE LAST EXIT TIME OF AN ELLIPTIC DIFFUSION PROCESS. Circular chromatic number and mycielski graphs. Embedding longest fault-free paths onto star garphs with more vertex faults. Fault-tolerant cycles embedding in the hypercube with more both faulty vertices and faulty edges. IEEE Transactions on Parallel and Distributed Syetems, 2009, 20(4): 581–592 Conditional edge-fault hamiltonicity of matching composition networks. Pancyclicity of restricted hypercube-like networks under the conditional fault model. Fault-free cycles in folded hypercubes with more faulty elements. A note on cycle embedding in folded hypercubes with faulty elements. Pancyclicity on the Mobius cube with both faulty nodes and faulty edges. Extended fault-tolerant cycle embedding in faulty hypercubes. A survey on cycle and path embedding in some networks. IEEE Transactions on Parallel and Distributed Systems, 1999, 10(3): 223–237 Fault-free Hamiltonian cycles in faulty arrangement graphs. Almost all n-dimensional retangular lattices are Hamiltonian-laceable. Hyper Hamiltonian-laceable and caterpillar-spannable product graphs. Introduction to Parallel Algorithms and Architecture: Arrays, Trees, Hypercubes. Usha Nandini, Complete binary trees in folded and enhanced cube. Embedding hamiltonian cycles into folded hypercubes with faulty links. On ring embedding in hypercubes with faulty nodes and links. Embedding a ring in a hypercube with both faulty links and faulty nodes. Proceedings of the 22 Annual International Symposium on Fault-Tolerant Computing, Boston: MA, 1992: 178–184 Optimal ring embedding in hypercubes with faulty links. Interna-tional Conference on Network Computing and Information Security, 2011, 2: 103–107 The Edge-Fault-Tolerant Hamiltonian Connectivity of Enhanced Hypercube. Hamiltonicity of the hierarchical cubic network. Fault-tolerant cycles embedding in the hypercube. Edge-fault-tolerant edge-bipancyclicity of hypercubes. Linear arry and ring embedding in conditional faulty hypercubes. Cycles embedding in hypercubes with node failures. Fault-tolerant Hamiltonian laceability of hypercubes. Bipanconnectivity and edge-fault-tolerant bipancyclicity of hyper-cubes. Hsieh, Some edge-fault-tolerant properties of the folded hypercube. Hamilitionaian-laceability of star graph. Hamiltonian-connectivity and strongly Hamilition-lacesbility of folded hypercubes. The construction of disjoint paths in folded hypercube. Properties and performance of enhanced hypercube networks. The 5th International Conference on Natural Computation, 2009: 345–348 The structural features of enhanced hypercube networks. London: Kluwer Academic Publish-ers, 1976