期刊文献+

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

Ring Embedding in(n,n-2)-Star Graphs with Conditional Edge Faults Conditional Edge Faults
下载PDF
导出
摘要 借用星图中解决包含错误边的圈的嵌入问题的思想,将其应用到组合星图中,解决组合星图中包含条件边错的圈的嵌入问题.应用数学归纳法分两种情况证明当错误边的数目|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
  • 相关文献

参考文献9

  • 1Yang Ming-Chien.Cycle embedding in star graphs with con-ditional edge faults[J].Applied Mathematics and computa-tion,2010,215:3541-3546.
  • 2Eddie,Jerrold W.Distance formula and shortest paths forthe(n,k)-star graphs[J].Information Sciences,2010,180:1671-1680.
  • 3Lin T C,Dyi-RongDuh.Constructing vertex-disjoint paths in(n,k)-star graphs[J].Information Sciences,2008,178:788-801.
  • 4Xiang Y H,Stewart Iain A.One-to-many node-disjointpaths in(n,k)-star graphs[J].Discret Applied Mathemat-ics,2010,158:32-70.
  • 5Li Tseng-Kuei,Tan Jimmy J M,Hsu Lih-Hsing.Hyperhamiltonian laceability on edge fault star graph[J].Infor-mation Sciences,2004,165:59-71.
  • 6Hsieh S Y,Chen G H,Ho C W.Longest fault-free pathsin Star graphs with edge faults[J].IEEE Trans.Comput,2001,50:960-971.
  • 7Chen Y Y,Duh D R,Ye T L,et al.Weak-vertex-pancyc-licity of(n,k)-star graphs[J].Theoretical Computer Sci-ence,2008,396:191-199.
  • 8Chiang W K,Chen R J.The(n,k)-star graph:An general-ized star graph[J].Information Processing Letters,1995,56:259-264.
  • 9Chiang W K,Chen R J.Topogical properties of the(n,k)-star graph[J].International Journal of Foundations ofScience,1998,9:235-248.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部