FAULT-TOLERANT MAXIMAL LOCAL-CONNECTIVITY ON CAYLEY GRAPHS GENERATED BY TRANSPOSITION TREES-Reference-Cited by-同舟云学术

FAULT-TOLERANT MAXIMAL LOCAL-CONNECTIVITY ON CAYLEY GRAPHS GENERATED BY TRANSPOSITION TREES

Published:2009-09 Issue:03 Volume:10 Page:253-260
ISSN:0219-2659
Container-title:Journal of Interconnection Networks
language:en
Short-container-title:J. Inter. Net.

Author:

SHIH LUN-MIN¹,CHIANG CHIEH-FENG¹,HSU LIH-HSING²,TAN JIMMY J. M.¹

Affiliation:

1. Department of Computer Science, National Chiao Tung University, Hsinchu, Taiwan 30050, R.O.C.

2. Department of Computer Science and Information Engineering, Providence University, Taichung, Taiwan 43301, R.O.C.

Abstract

The local connectivity of two vertices is defined as the maximum number of internally vertex-disjoint paths between them. In this paper, we define two vertices as maximally local-connected, if the maximum number of internally vertex-disjoint paths between them equals the minimum degree of these two vertices. Moreover, we show that an (n-1)-regular Cayley graph generated by transposition tree is maximally local-connected, even if there are at most (n-3) faulty vertices in it, and prove that it is also (n-1)-fault-tolerant one-to-many maximally local-connected.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Networks and Communications

Link

https://www.worldscientific.com/doi/pdf/10.1142/S021926590900256X

Reference10 articles.

1. A group-theoretic model for symmetric interconnection networks

2. Linearly many faults in Cayley graphs generated by transposition trees

3. In abstrakten Graphen vorhandene vollständige 4-Graphen und ihre Unterteilungen

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The (E)FTSM-(edge) Connectivity of Cayley Graphs Generated by Transposition Trees;International Journal of Foundations of Computer Science;2021-10-14

2. Fault-Tolerant Maximal Local-Edge-Connectivity of Augmented Cubes;Parallel Processing Letters;2020-09

3. Strong Menger Connectedness of Augmented k-ary n-cubes;The Computer Journal;2020-05-09

4. Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transpositions;International Journal of Foundations of Computer Science;2019-12

5. Parallel routing in regular networks with faults;Information Processing Letters;2019-02