The connectivity of faulty folded hypercube networks

DOI

10.2991/peee-15.2015.72How to use a DOI?

Keywords

network connectivity; folded hypercube networks

Abstract

The connectivity of a topology of a given network is one of the most important issues in determining whether a network can simulate routings of various lengths. In this paper, it shows that any two distinct nodes x,y are connected by paths of every length from d(x,y) to 2n-1 in folded hypercube networks FQn-Fe with |Fn| n-1if each node is incident with at least m(2 m n) fault-free links, where d(x,y)is the distance between x,y , and Fe is the set of fault links.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - D. Yuan
AU  - H.M. Liu
AU  - M.Z. Tang
PY  - 2015/04
DA  - 2015/04
TI  - The connectivity of faulty folded hypercube networks
BT  - Proceedings of the 2015 International Conference on Power Electronics and Energy Engineering
PB  - Atlantis Press
SP  - 261
EP  - 265
SN  - 2352-5401
UR  - https://doi.org/10.2991/peee-15.2015.72
DO  - 10.2991/peee-15.2015.72
ID  - Yuan2015/04
ER  -