论文信息 - Cartesian Products of Graphs as Subgraphs of De Bruijn Graphs of Dimension at Least Three

Cartesian Products of Graphs as Subgraphs of De Bruijn Graphs of Dimension at Least Three

Given a Cartesian product G=G_1timesldotstimes G_m;(mgeq2) of nontrivial connected graphs G_i and the base d, dimension D de Bruijn graph B(d,D), it is investigated under which conditions G is (or is not) a subgraph of B(d,D). We present a complete solution of this problem for the case Dgeq4. For D=3, we give partial results including a complete solution for the case that G is a torus, i.e., G is the Cartesian product of cycles.

[1] Gerald Schreiber,et al. Cartesian Products of Graphs as Spanning Subgraphs of De Bruijn Graphs (Extended Abstract) , 1994, WG.

[2] Jaroslav Opatrny,et al. Embeddings of Hypercubes and Grids into de Bruijn Graphs , 1994, J. Parallel Distributed Comput..

[3] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[4] Elwood S. Buffa,et al. Graph Theory with Applications , 1977 .

[5] Harold S. Stone,et al. Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

[6] Gerald Schreiber,et al. PIPS--A general purpose Parallel Image Processing System , 1994 .

[7] E T. Leighton,et al. Introduction to parallel algorithms and architectures , 1991 .

[8] Dhiraj K. Pradhan,et al. The De Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI , 1989, IEEE Trans. Computers.

[9] Burkhard Monien,et al. Embedding one interconnection network in another , 1990 .