Randomly Twisted Hypercubes
نویسندگان
چکیده
A twisted hypercube of dimension k is created from two twisted hypercubes of dimension k − 1 by adding a matching joining their vertex sets, with the twisted hypercube of dimension 0 consisting of one vertex and no edges. We generate random twisted hypercube by generating the matchings randomly at each step. We show that, asymptotically almost surely, joining any two vertices in a random twisted hypercube of dimension k there are k internally disjoint paths of length at most k lg k +O ( k lg2 k ) . Since the graph is k-regular with 2 vertices, the number of paths is optimal and the length is asymptotically optimal.
منابع مشابه
A Formal Study of the Mcube Interconnection Network
The Mcube network has been proposed in [11] as a highly recursive and symmetrical interconnection network based on twisted links [1]. The Mcube topology has been developed and defined in terms of the structural constraints between components to enforce structural symmetry instead of specifying edges between node pairs. Mcubes have almost half the diameter of a comparable hypercube, a lower aver...
متن کاملWirelength of 1-fault hamiltonian graphs into wheels and fans
In this paper we obtain a fundamental result to find the exact wirelength of 1-fault hamiltonian graphs into wheels and fans. Using this result we compute the exact wirelength of circulant graphs, generalized petersen graphs, augmented cubes, crossed cubes, mőbius cubes, locally twisted cubes, twisted cubes, twisted n-cubes, generalized twisted cubes, hierarchical cubic networks, alternating gr...
متن کاملA note on minimum linear arrangement for BC graphs
A linear arrangement is a labeling or a numbering or a linear ordering of the vertices of a graph. In this paper we solve the minimum linear arrangement problem for bijective connection graphs (for short BC graphs) which include hypercubes, Möbius cubes, crossed cubes, twisted cubes, locally twisted cube, spined cube, Z-cubes, etc. as the subfamilies.
متن کاملConnectivity of Locally Exchanged Twisted Cubes∗
Connectivity κ(G) of a graph G is the minimum number of vertices whose removal leaves the remaining graph disconnected or trivial. This parameter is important for interconnection networks and can be used to measure reliability in such networks. In this paper, a new interconnection network called locally exchanged twisted cube (LETQ for short), denoted LeTQ(s, t), is proposed. We obtain some bas...
متن کاملEfficient Embeddings into Hypercube-like Topologies
Embeddings of various graph classes into hypercubes have been widely studied. Almost all these classes are regularly structured graphs such as meshes, complete trees or pyramids. In this paper, we present a general method for one-to-one embeddings of irregularly structured graphs into their optimal hypercubes, based on extended edge bisectors of graphs. An extended edge bisector is an edge bise...
متن کامل