›› 2015, Vol. 28 ›› Issue (1): 89-.

• 论文 • 上一篇    下一篇

Cayley图在比较模型下的可诊断性

周俊   

  1. (西安电子科技大学 数学与统计学院,陕西 西安 710071)
  • 出版日期:2015-01-15 发布日期:2015-01-22
  • 作者简介:周俊(1989—),男,硕士研究生。研究方向:互联网络的可靠性及故障诊断。E-mail:junxiaopz@163.com

Diagnosability of Cayley Graphs Generated By Transposition Trees Under The Comparison Diagnosis Model

ZHOU Jun   

  1. (School of Mathematics and Statistics,Xidian University,Xi'an 710071,China)
  • Online:2015-01-15 Published:2015-01-22

摘要:

可诊断性在互连网络的可靠性中有着重要作用,当n≥4时,已经证明了n维星图是(n-1)-可诊断的。星图是属于置换树生成的Cayley图的一类形式。文中将证明当n≥5时,置换树生成的Cayley图在比较模型下是(n-1)-可诊断的

关键词: 诊断性, 互联网络, Cayley图, 比较模型

Abstract:

Diagnosability has played an important role in the reliability of an interconnection network.The n-dimensional star graph has been proved to be (n-1)-diagnosable under the comparison model when n≥4.A star graph belongs to a class of Cayley graphs generated by transposition trees.In this paper,Cayley graphs generated by transposition trees have been proved to be (n-1)-diagnosable under the comparison model when n≥5.

Key words: diagnosability;interconnection network;Cayley graph;comparison model

中图分类号: 

  • TP277.3