Restricted connectivity for three families of interconnection networks
| Autor: | Jimmy J. M. Tan, Y-Chuang Chen |
|---|---|
| Rok vydání: | 2007 |
| Předmět: |
Discrete mathematics
Interconnection Theoretical computer science Applied Mathematics Fault tolerance Star (graph theory) Computational Mathematics Hypercube Enhanced Data Rates for GSM Evolution Resilience (network) Circulant matrix Connectivity MathematicsofComputing_DISCRETEMATHEMATICS Mathematics |
| Zdroj: | Applied Mathematics and Computation. 188:1848-1855 |
| ISSN: | 0096-3003 |
| DOI: | 10.1016/j.amc.2006.11.085 |
| Popis: | Vertex connectivity and edge connectivity are two important parameters in interconnection networks. Even though they reflect the fault tolerance correctly, they undervalue the resilience of large networks. By the concept of conditional connectivity and super-connectivity, the concept of restricted vertex connectivity and restricted edge connectivity of graphs was proposed by Esfahanian [A.H. Esfahanian, Generalized measures of fault tolerance with application to N-cube networks, IEEE Transactions on Computers 38 (1989) 1586–1591]. Such measures take the resilience of large networks into consideration. In this paper, we propose three families of interconnection networks and discuss their restricted vertex connectivity and restricted edge connectivity. In particular, the hypercubes, twisted-cubes, crossed-cubes, mobius cubes, star graphs, pancake graphs, recursive circulant graphs, and k-ary n-cubes are special cases of these families. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect