Diagnosability of Cayley graphs generated by transposition trees with missing edges

被引:26
作者
Cheng, Eddie [1 ]
Liptak, Laszlo [1 ]
机构
[1] Oakland Univ, Dept Math & Stat, Rochester, MI 48309 USA
关键词
Cayley graphs; Transposition trees; Strong local diagnosability;
D O I
10.1016/j.ins.2013.03.009
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Recently, strong local diagnosability properties for star graphs were proved even with missing edges. We extend these results to Cayley graphs generated by transposition trees. (C) 2013 Elsevier Inc. All rights reserved.
引用
收藏
页码:250 / 252
页数:3
相关论文
共 6 条
[1]   Hyper hamiltonian laceability of Cayley graphs generated by transpositions [J].
Araki, Toru .
NETWORKS, 2006, 48 (03) :121-124
[2]   Diagnosability of star graphs with missing edges [J].
Chiang, Chieh-Feng ;
Hsu, Guo-Huang ;
Shih, Lun-Min ;
Tan, Jimmy J. M. .
INFORMATION SCIENCES, 2012, 188 :253-259
[3]   FAULT-TOLERANT MAXIMAL LOCAL-CONNECTIVITY ON CAYLEY GRAPHS GENERATED BY TRANSPOSITION TREES [J].
Shih, Lun-Min ;
Chiang, Chieh-Feng ;
Hsu, Lih-Hsing ;
Tan, Jimmy J. M. .
JOURNAL OF INTERCONNECTION NETWORKS, 2009, 10 (03) :253-260
[4]   Bipancyclic properties of Cayley graphs generated by transpositions [J].
Tanaka, Yuuki ;
Kikuchi, Yosuke ;
Araki, Toru ;
Shibata, Yukio .
DISCRETE MATHEMATICS, 2010, 310 (04) :748-754
[5]  
Tchuente M., 1982, ARS COMBINATORIA, V14, P115
[6]   Conditional connectivity of Cayley graphs generated by transposition trees [J].
Yang, Weihua ;
Li, Hengzhe ;
Meng, Jixiang .
INFORMATION PROCESSING LETTERS, 2010, 110 (23) :1027-1030