The bicube: an interconnection of two hypercubes
Authors:
- 27 March 2014
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 92 (1) , 29-40
Abstract
We consider two definitions of the even-dimensional hypercube given in the literature. The labelled graphs obtained by two definitions are not same, but one is isomorphic to the other. By interconnecting two labelled graphs in such a way that each pair of vertices with the same label are joined by an edge, we construct a vertex-symmetric graph with the diameter about half that of a comparable hypercube. We extend the result to a general scheme for interconnecting two hypercubes to produce a network topology called the bicube. We show that the bicube preserves the vertex-symmetry, bipartiteness, hamiltonian and bipancyclic properties of the hypercube, and is highly edge-symmetric.Keywords
This publication has 13 references indexed in Scilit:
- Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphsInformation Sciences, 2013
- The spanning laceability on the faulty bipartite hypercube-like networksApplied Mathematics and Computation, 2013
- General-demand disjoint path covers in a graph with faulty elementsInternational Journal of Computer Mathematics, 2012
- The spined cube: A new hypercube variant with smaller diameterInformation Processing Letters, 2011
- The bipanconnectivity and -panconnectivity of the folded hypercubeTheoretical Computer Science, 2007
- Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elementsTheoretical Computer Science, 2007
- Hamiltonian properties on the class of hypercube-like networksInformation Processing Letters, 2004
- Recursive circulants and their embeddings among hypercubesTheoretical Computer Science, 2000
- On the generalized twisted cubeInformation Processing Letters, 1995
- Enhanced hypercubesIEEE Transactions on Computers, 1991