k次Petersen连通圈网络

k Times Petersen Connected Cycles Networks

摘要: 互连网络是超级计算机体系结构的重要组成部分。文中利用正则图连通圈网络模型，设计出了新模型k次Petersen连通圈网络PGCC(k)，它是3正则3连通的，且具有其他好的性质。本文对它的圈因子分解、Hamilton性和一些基本性质进行了研究，并证明了PGCC(1)可分解为边不交的两个等长圈和一个完美对集的并。

Abstract: Interconnected networks are an important part of supercomputer architecture. In the paper, using the regular graph connected circle network model, a new model kth Peterson connected circle network PGCC(k), which is 3-regular 3-connected and has many good properties, is designed. In this paper, we study its circle factorization, Hamiltonianity and some basic properties, and prove that PGCC(1) can be decomposed into two equal circles with non-intersecting edges and a perfect pairwise set of merges.