期刊文献+

关于4连通图的容错直径和宽直径 被引量:1

On Fault-Tolerant Diameter And Wide Diameter Of 4-Connected Graphs
下载PDF
导出
摘要 容错直径和宽直径是度量网络可靠性和有效性的重要参数.对任意k连通图,它的容错直径Dk,不超过宽直径dk.本文证明:当G是4连通图时,若D3=2,d4≤{D4+1,8D4?17};若D3≥3,d4≤max{3D2(3D4?D2?13)+1,2D2D3(D4?2)+D2?D2+1,3D2(D3?1)(D4?2)?D2?D2+1}12332并2222且证明对n(n≥3)连通图,当Dn=2时,2≤dn≤3. Fault-tolerant diameter Dk and wide diameter dk are two important parameters for measuring reliability and efficiency of an interconnection network. It is clear Dk does not exceed dk for any k-connected graph. This paper shows that d4 ≤{D4 +1,8D4 ?17}if D3 =2 and d4 ≤ max{3D2(3D4 ? D2 ?13) +1,2D2D3(D4 ? 2) + D2 ? D2 +1,3D2(D3 ?1)(D4 ? 2) ? D2 ? D2 +1} 1 2 3 3 2 2 2 2 2 when G is a 4-connected graph.Then this paper also prove that 2 ≤ dn ≤ 3 if Dn =2 when G is a n-connected graph.
作者 林福财
出处 《漳州师范学院学报(自然科学版)》 2005年第1期13-18,共6页 Journal of ZhangZhou Teachers College(Natural Science)
关键词 连通图 宽直径 容错直径 证明 参数 度量 有效性 网络可靠性 Connected graph Fault-tolerant diameter Wide diameter
  • 相关文献

参考文献7

  • 1Krishnamoortht M.S, Krishnamurthy. B. Fault diameter of interconnection networks Computers and Mathematics with Applications, 1987, 13(5/6): 577-582.
  • 2Hsu DF. On container width and length ingraphs, groups and networks IEICE Trans Fund. Elect[J]. Comn. Comput, 1994, E77-A:668-680.
  • 3Hsu. DF, Lyuu YD. Agraph-theoretical study of transmission delay and fault tolerance International Journal of Mini and Microcomputers, 1994,16(1): 35-42.
  • 4Llandrin E,Li H. Mengerian properties,hamiltonicity, and claw-free graphs[J]. Networks, 1994, 24(2): 177-183.
  • 5Lian SC, Chang GJ. Generalized diameters and Rabin numbers of networks J.of Combin Optimization, 1999, 2(3): 371-384.
  • 6徐俊明,谢歆.关于图的容错直径和宽直径[J].中国科学技术大学学报,2002,32(2):135-139. 被引量:12
  • 7谢歆,徐俊明.关于3连通图的容错直径和宽直径[J].数学研究,2003,36(3):293-296. 被引量:5

二级参考文献6

  • 1Krishnamoorthy M S, Krishnamurthy B. Fault diameter of interconnection networks. Computers and Mathematics with Applications, 1987, 13(5/6):577-582.
  • 2Hsu D F. On container width and length in graphs, groups and networks. IEICE Trans Fund Elect Comm Comput. 1994, E77-A:668-680.
  • 3Hsu D F, Lyuu Y D. A graph-theoretical study of transmission delay and fault tolerance. International Journal of Mini and Microcomputers, 1994, 16(1).35-42.
  • 4Liandrin E, Li H. Mengerian properties, hamiltonicity, and claw-free graphs, Networks. 1994, 24(2):177- 183.
  • 5Liaw S C, Chang G J. Generalized diameters and Rabin numbers of networks. J. of Combin. Optimization. 1999, 2(3):371-384.
  • 6徐俊明,陶颖峰,徐克力.关于de Bruijn图中限长路的注记(英文)[J].中国科学技术大学学报,2002,32(1):19-21. 被引量:3

共引文献12

同被引文献5

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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