安置图的推广和它的哈密尔顿性

The Arrangement Graphs are Hamiltonian Graphs

本文证明星形图的推广安置图并行结构是有哈密尔顿回路的，从而为今后在这种网络上设计算法打下了基础。文章还提出两种广义安置图结构，并初步讨论了它们的性质。

This paper studies the existence of Hamiltonian cycle in arrangement graphs which are a generalization of the star graphs. Thus it will be possible to implement operations such as sorting using this Hamiltonian eye ie on these parallel structures.