Information Processing Letters
Efficient Collective Communications in Dual-Cube
The Journal of Supercomputing
Graph Theory With Applications
Graph Theory With Applications
The super connectivity of the pancake graphs and the super laceability of the star graphs
Theoretical Computer Science
Cycles embedding in hypercubes with node failures
Information Processing Letters
On the spanning connectivity and spanning laceability of hypercube-like networks
Theoretical Computer Science
Fault-tolerant cycle embedding in dual-cube with node faults
International Journal of High Performance Computing and Networking
The edge-pancyclicity of dual-cube extensive networks
CEA'08 Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications
On embedding cycles into faulty dual-cubes
Information Processing Letters
| Hi-index | 0.00 |
In 2000, Li et al. introduced dual-cube networks, denoted by DC"n for n=1, using the hypercube family Q"n and showed the vertex symmetry and some fault-tolerant hamiltonian properties of DC"n. In this article, we introduce a new family of interconnection networks called dual-cube extensive networks, denoted by DCEN(G). Given any arbitrary graph G, DCEN(G) is generated from G using the similar structure of DC"n. We show that if G is a nonbipartite and hamiltonian connected graph, then DCEN(G) is hamiltonian connected. In addition, if G has the property that for any two distinct vertices u,v of G, there exist three disjoint paths between u and v such that these three paths span the graph G, then DCEN(G) preserves the same property. Furthermore, we prove that the similar results hold when G is a bipartite graph.