### Abstract

Given a graph G and non-negative integer h, the h-restricted connectivity of G is the minimum cardinality of a set of nodes in G, if exists, whose deletion disconnects G and the degree of each node in every remaining component is at least h. The h-restricted connectivity is a generalization of the classical connectivity and can provide more accurate measures for the reliability or fault-tolerance of multiprocessor system. The n-dimensional locally twisted cubes, denoted by LTQ_{n}, are a well-known network topology for building multiprocessor systems. In this paper, we first show that 2-restricted connectivity of the n-dimensional locally twisted cubes is 4n-8 for n≥4, and show that 3-restricted connectivity is equal to 8n-24 for n≥5.

Original language | English |
---|---|

Pages (from-to) | 78-90 |

Number of pages | 13 |

Journal | Theoretical Computer Science |

Volume | 615 |

DOIs | |

Publication status | Published - 2016 Feb 15 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Theoretical Computer Science*,

*615*, 78-90. https://doi.org/10.1016/j.tcs.2015.11.050

}

*Theoretical Computer Science*, vol. 615, pp. 78-90. https://doi.org/10.1016/j.tcs.2015.11.050

**{2,3}- Restricted connectivity of locally twisted cubes.** / Hsieh, Sun-Yuan; Huang, Hong Wen; Lee, Chia Wei.

Research output: Contribution to journal › Article

TY - JOUR

T1 - {2,3}- Restricted connectivity of locally twisted cubes

AU - Hsieh, Sun-Yuan

AU - Huang, Hong Wen

AU - Lee, Chia Wei

PY - 2016/2/15

Y1 - 2016/2/15

N2 - Given a graph G and non-negative integer h, the h-restricted connectivity of G is the minimum cardinality of a set of nodes in G, if exists, whose deletion disconnects G and the degree of each node in every remaining component is at least h. The h-restricted connectivity is a generalization of the classical connectivity and can provide more accurate measures for the reliability or fault-tolerance of multiprocessor system. The n-dimensional locally twisted cubes, denoted by LTQn, are a well-known network topology for building multiprocessor systems. In this paper, we first show that 2-restricted connectivity of the n-dimensional locally twisted cubes is 4n-8 for n≥4, and show that 3-restricted connectivity is equal to 8n-24 for n≥5.

AB - Given a graph G and non-negative integer h, the h-restricted connectivity of G is the minimum cardinality of a set of nodes in G, if exists, whose deletion disconnects G and the degree of each node in every remaining component is at least h. The h-restricted connectivity is a generalization of the classical connectivity and can provide more accurate measures for the reliability or fault-tolerance of multiprocessor system. The n-dimensional locally twisted cubes, denoted by LTQn, are a well-known network topology for building multiprocessor systems. In this paper, we first show that 2-restricted connectivity of the n-dimensional locally twisted cubes is 4n-8 for n≥4, and show that 3-restricted connectivity is equal to 8n-24 for n≥5.

UR - http://www.scopus.com/inward/record.url?scp=84953369570&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84953369570&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2015.11.050

DO - 10.1016/j.tcs.2015.11.050

M3 - Article

AN - SCOPUS:84953369570

VL - 615

SP - 78

EP - 90

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -