论文信息 - The 4-Star Graph is not a Subgraph of Any Hypercube - 字舞流文

The 4-Star Graph is not a Subgraph of Any Hypercube

Abstract We prove that it is impossible to precisely embed any star graph S n ( n ⩾4) into a hypercube.

Qing Hu | Xiaojun Shen | Ivan Hal Sudborough | Saïd Bettayeb | Bin Cong | I. H. Sudborough | Mike Girou | S. Bettayeb | Xiaojun Shen | Qing Hu | B. Cong | M. Girou

[1] Sartaj Sahni,et al. Embedding Hamiltonians and Hypercubes in Star Interconnection Graphs , 1990, ICPP.

[2] Sheldon B. Akers,et al. A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.

[3] N. Biggs. Algebraic Graph Theory: COLOURING PROBLEMS , 1974 .

[4] F. Leighton,et al. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[5] Sheldon B. Akers,et al. The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.

[6] Ivan Hal Sudborough,et al. Simulation Permutation Networks on Hypercubes , 1992, LATIN.