期刊文献+

排列图的若干k^*-连通性

Some Properties of Arrangement Graphs A_(n,k)
下载PDF
导出
摘要 排列图An,k是星图的推广,但它的阶却比星图有更好的灵活性.证明了:当n5,n-k3时,排列图An,k为3*-连通图;当n6,n-k3时,排列图An,k为4*-连通图. The arrangement graphs An,k is a generalization of the star graphs, yet it is more flexible in its size than the Star Graphs. This paper proves that the arrangement graphs An,k is 3 * - connected in the case of n≥5, n-k ≥3 and 4^*- connected in the case of n≥ 6, n -k≥3.
作者 徐辉
出处 《绍兴文理学院学报》 2013年第7期25-28,共4页 Journal of Shaoxing University
关键词 排列图 k*-连通 容器 连通 超支撑连通 arrangement graphs k ^* - connection container connection super spanning connection
  • 相关文献

参考文献5

  • 1Day K, Tripathi A. Arrangement graphs : a class of generalized star graphs [ J ]. Information Processing Let- ters, 1992,42 (5) :235 - 241.
  • 2Day K,Tripathi A. Characterization of Node Disjoint Paths in Arrangement Graphs[ D]. Technical Report TR 91 - 43, Computer Science Department, University of Minnesota, 1991.
  • 3Day K,Tripathi A. Embedding of cycles in arrangement graphs [ J ]. IEEE Transactions on Computers, 1993, 42(8) :1002 - 1006.
  • 4Day K, Tripathi A. Embedding of cycles in arrangement graphs [ J ]. IEEE Transactions on Computers, 1993, 42(8) :1002 - 1006.
  • 5Hsu H - Chun . The Spanning Connectivity of the ( n, k) - Star Graphs [ J ]. International Journal of Founda- tions of Computer Science 2006,17 (2) :415 - 434.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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