带故障边的路和圈的笛卡尔乘积图的哈密尔顿路  

Hamiltonian Paths of Cartesian Product Graphs of Paths and Cycles with Faulty Edges

作　　者：姜璎哲 李晶[1] JIANG Ying-Zhe;LI Jing(School of Applied Science,Taiyuan University of Science and Technology,Taiyuan 030024,China)

机构地区：[1]太原科技大学应用科学学院,太原030024

出　　处：《太原科技大学学报》2023年第3期268-273,共6页Journal of Taiyuan University of Science and Technology

基　　金：国家自然科学基金(52004169);山西省留学人员回国科研项目(2020-122)。

摘　　要：容错哈密尔顿性是互连网络研究的经典问题之一,它是衡量一个网络可靠性的重要标准,被广泛应用到当前大型分布式系统的网络拓扑中。该文研究具有一条故障边的路和圈的笛卡尔乘积图P_(m)×C_(n)上的哈密尔顿路存在问题,根据故障边位置的不同,对当m≥3,n≥5且n是奇数时的P_(m)×C_(n)中哈密尔顿路进行了刻画。Fault-tolerant Hamiltonian is one of the classical problems in the research of interconnection networks.It is an important standard to measure the reliability of a network,and it is widely used in the current network topology of large-scale distributed systems.In this paper,the Hamiltonian problem on Cartesian product graphs of paths and cycles P_(m)×C_(n) with one fault edge is considered.According to the different positions of the fault edge,the Hamiltonian paths in P_(m)×C_(n) are characterized when m≥3,n≥5 and n is odd.

关 键 词：互连网络 笛卡尔乘积图 容错问题 哈密尔顿路 

分 类 号：O157.5[理学—数学]