一种笛卡尔乘积网络的泛圈性研究
The Pancyclicity Study of a Cartesian Product Network
DOI: 10.12677/AAM.2021.105190, PDF,   
作者: 张治成：石河子大学理学院数学系，新疆 石河子
关键词: 笛卡尔乘积网络；互连网络；；Hamilton图；泛圈性；Cartesian Product Network； Interconnection Network； ； Hamilton Graph； Pancyclicity
摘要: 网络中子图的可嵌入性是度量网络性能的一个重要指标。圈作为网络拓扑中一类重要的子图，其可嵌入性可通过图的泛圈性来衡量。笛卡尔乘积网络DSCC(k)×Cm是在2018年被提出的一种新互连网络。在之前文献研究结果的基础上，文中进一步研究得到DSCC(0)×C3是泛圈的，DSCC(0)×C3(m>3)是边偶泛圈的，DSCC(k)×Cm(k>0,m≥3)是泛圈的。
Abstract: 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.
文章引用：张治成. 一种笛卡尔乘积网络的泛圈性研究[J]. 应用数学进展, 2021, 10(5): 1797-1803. https://doi.org/10.12677/AAM.2021.105190

参考文献

[1] Bondy, J.A. and Murty, U.S.R. (2008) Graph Theory. Springer, New York, London.
[2] Xu, J.M. (2015) A First Course in Graph Theory. Science Press, Beijing.
[3] Bhavani, K. and Jena, S. (2018) Exchanged Folded Crossed Cube: A New Interconnection Network for Parallel Computation. Information processing Letters, 137, 40-46. [Google Scholar] [CrossRef] 
[4] 师海忠, 张治成. k次十二面体-师连通圈网络[J]. 计算机科学与应用, 2018, 8(6): 1013-1026.
[5] Borse, Y.M. and Saraf, J.B. (2018) Existence of 3-Regular Subgraphs in Cartesian Product of Cycles. AKCE International Journal of Graphs and Combinatorics, 16, 332-342. [Google Scholar] [CrossRef] 
[6] Darbinyan, S.K.H. (2019) Sufficient Conditions for Hamiltonian Cycles in Bipartite Digraphs. Discrete Applied Mathematics, 258, 87-96. [Google Scholar] [CrossRef] 
[7] 张治成. 十二面体-师连通圈网络及其笛卡尔乘积网络研究[D]: [硕士学位论文]. 兰州: 西北师范大学数学与统计学院, 2020.
[8] Shuya, C. (2018) On Degree Sum Conditions for 2-Factors with a Prescribed Number of Cycles. Discrete Mathematics, 341, 2912-2918. [Google Scholar] [CrossRef] 
[9] Akers, S.B. and Krishnamurthy, B. (1989) A Group-Theoretic Model for Symmetric Interconnection Networks. IEEE Transactions on Computers, 38, 555-566. [Google Scholar] [CrossRef] 
[10] Bogdanowicz, Z.R. (2017) On Decomposition of the Cartesian Product of Directed Cycles into Cycles of Equal Lengths. Discrete Applied Mathematics, 299, 148-150. [Google Scholar] [CrossRef] 
[11] Lv, H.Z. and Wu, T.Z. (2019) Edge-Disjoint Hamiltonian Cycles of Balanced Hypercubes. Information Processing Letters, 144, 25-30. [Google Scholar] [CrossRef] 
[12] Hsu, L.H., Ho, T.Y., Ho, Y.H. and Tsay, C.-W. (2014) Cycles in Cube-Connected Cycles Graphs. Discrete Applied Mathematics, 167, 163-171. [Google Scholar] [CrossRef] 
[13] Gao, H., Lv, B.J. and Wang, K.S. (2018) Two Lower Bounds for Generalized 3-Connectivity of Cartesian Product Graphs. Applied Mathematics and Computation, 338, 305-313. [Google Scholar] [CrossRef] 
[14] Li, Q., Shiu, W.C. and Yao, H. (2015) Matching Preclusion for Cube-Connected Cycles. Discrete Applied Mathematics, 190-191, 118-126. [Google Scholar] [CrossRef] 

为你推荐