一种笛卡尔乘积网络的泛圈性研究

The Pancyclicity Study of a Cartesian Product Network

网络中子图的可嵌入性是度量网络性能的一个重要指标。圈作为网络拓扑中一类重要的子图,其可嵌入性可通过图的泛圈性来衡量。笛卡尔乘积网络DSCC(k)×Cm是在2018年被提出的一种新互连网络。在之前文献研究结果的基础上,文中进一步研究得到DSCC(0)×C3是泛圈的,DSCC(0)×C3(m】3)是边偶泛圈的,DSCC(k)×Cm(k】0,m≥3)是泛圈的。

The embeddability of neutron graph is an important index to measure the performance of network. As an important kind of subgraphs of network topology, the embeddability of circles can be measured by the pancyclicity property of graphs. Cartesian product network DSCC(k)×Cm is a new interconnecting network proposed in 2018. Based on the results of previous literature, this paper further finds that DSCC(0)×C3 is pancyclic, DSCC(0)×C3(m>3) is edge bipancyclic and DSCC(k)×Cm(k>0,m≥3) is pancyclic.