摘要
借用星图中解决包含错误边的哈密尔顿圈的嵌入问题的思想,将其应用到组合星图中,解决组合星图中包含条件边错的哈密尔顿圈的嵌入问题.应用数学归纳法分两种情况证明当错误边的总数|f|≤n-3时,组合星图Sn,2(n≥4)中存在哈密尔顿圈.
It utilizes ideas of cycle embedding in star graphs with conditional edge faults to solve the problem in (n,k)-star graphs. The problem can be solved in two cases, and it is proved that fault-free Hamilton rings can be found in Sn.2, with |f| ≤ n -3 , and n ≥4.
出处
《广东工业大学学报》
CAS
2012年第4期69-71,共3页
Journal of Guangdong University of Technology
关键词
星图
组合星图
嵌入
数学归纳法
哈密尔顿圈
star graph
( n, k) -star graph
embedding
mathematical induction
Hamilton rings