摘要
借用星图中解决包含错误边的圈的嵌入问题的思想,将其应用到组合星图中,解决组合星图中包含条件边错的圈的嵌入问题.应用数学归纳法分两种情况证明当错误边的数目|f|=1时,对于组合星图Sn,n-2(n≥4)中任意一条健康边存在通过此边的所有长度从7到(n!)/2-1的不含错误边的圈.
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.
出处
《广东工业大学学报》
CAS
2012年第1期69-73,82,共6页
Journal of Guangdong University of Technology
关键词
组合星图
星图
嵌入
同构
圈
(n
k)-star graph
star graph
embedding
isomorphic
cycle