组合星图中包含条件边错的圈的嵌入问题

摘要

It presents the ideas of cycle embedding in star graphs with conditional edge faults to solve the same problem in (n,k)-star graphs. This problem can be solved in two ways to prove that the length of fault-free rings in Sn n_2 ranges from 7 to n!/2-1, with f = 1 and (n≥4). Moreover, each cycle of the available length in an can contain a desired 1-edge.%借用星图中解决包含错误边的圈的嵌入问题的思想,将其应用到组合星图中,解决组合星图中包含条件边错的圈的嵌入问题.应用数学归纳法分两种情况证明当错误边的数目｜f｜=1时,对于组合星图Sn.n-2(n≥4)中任意一条健康边存在通过此边的所有长度从7到n!/2-1的不含错误边的圈.