Given a connected bipartite graph G, we describe a procedure which enumerates and computes all graphs H (if any) for which there is a direct product factorization G ∼= H × K2. W...
Ghidewon Abay-Asmerom, Richard Hammack, Craig E. L...
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...
Aniruddha S. Vaidya, P. S. Nagendra Rao, S. Ravi S...
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...
Michael Klugerman, Alexander Russell, Ravi Sundara...
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 ...
We present a method for searching for achordal open paths (snakes) in n-dimensional hypercube graphs (the box). Our technique first obtains a set of exemplary snakes using an evo...
Daniel R. Tuohy, Walter D. Potter, Darren A. Casel...