62 search results - page 1 / 13 » On embedding complete graphs into hypercubes |
DM
1998
13 years 4 months ago
1998
An embedding of Kn into a hypercube is a mapping of the n vertices of Kn to distinct vertices of the hypercube, and the associated cost is the sum over all pairs of (mapped) verti...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
Owing to its nice properties, the pancake is one of the Cayley graphs that were proposed as alternatives to the hypercube for interconnecting processors in parallel computers. In ...
ENDM
2007
13 years 4 months ago
2007
Kreweras’ conjecture [9] asserts that every perfect matching of the hypercube Qd can be extended to a Hamiltonian cycle of Qd. We [5] proved this conjecture but here we present ...
SPDP
1993
IEEE
13 years 9 months ago
1993
IEEE
W e introduce a class of graphs which are variants of the hypercube graph. M a n y of the properties of this class of graphs are similar to that of the hypercube hence, we refer t...
SIAMDM
2010
12 years 11 months ago
2010
The routing number rt(G) of a connected graph G is the minimum integer r so that every permutation of vertices can be routed in r steps by swapping the ends of disjoint edges. In t...