The Edge Connectivity of Expanded k-Ary n-Cubes
Mass data processing and complex problem solving have higher and higher demands for performance of multiprocessor systems. Many multiprocessor systems have interconnection networks as underlying topologies. The interconnection network determines the performance of a multiprocessor system. The networ...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2018-01-01
|
| Series: | Discrete Dynamics in Nature and Society |
| Online Access: | http://dx.doi.org/10.1155/2018/7867342 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849410557047734272 |
|---|---|
| author | Shiying Wang Mujiangshan Wang |
| author_facet | Shiying Wang Mujiangshan Wang |
| author_sort | Shiying Wang |
| collection | DOAJ |
| description | Mass data processing and complex problem solving have higher and higher demands for performance of multiprocessor systems. Many multiprocessor systems have interconnection networks as underlying topologies. The interconnection network determines the performance of a multiprocessor system. The network is usually represented by a graph where nodes (vertices) represent processors and links (edges) represent communication links between processors. For the network G, two vertices u and v of G are said to be connected if there is a (u,v)-path in G. If G has exactly one component, then G is connected; otherwise G is disconnected. In the system where the processors and their communication links to each other are likely to fail, it is important to consider the fault tolerance of the network. For a connected network G=(V,E), its inverse problem is that G-F is disconnected, where F⊆V or F⊆E. The connectivity or edge connectivity is the minimum number of F. Connectivity plays an important role in measuring the fault tolerance of the network. As a topology structure of interconnection networks, the expanded k-ary n-cube XQnk has many good properties. In this paper, we prove that (1) XQnk is super edge-connected (n≥3); (2) the restricted edge connectivity of XQnk is 8n-2 (n≥3); (3) XQnk is super restricted edge-connected (n≥3). |
| format | Article |
| id | doaj-art-7b5b56d3c91c415183d6d19e700cebe3 |
| institution | Kabale University |
| issn | 1026-0226 1607-887X |
| language | English |
| publishDate | 2018-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Discrete Dynamics in Nature and Society |
| spelling | doaj-art-7b5b56d3c91c415183d6d19e700cebe32025-08-20T03:35:03ZengWileyDiscrete Dynamics in Nature and Society1026-02261607-887X2018-01-01201810.1155/2018/78673427867342The Edge Connectivity of Expanded k-Ary n-CubesShiying Wang0Mujiangshan Wang1School of Mathematics and Information Science, Henan Normal University, Xinxiang, Henan 453007, ChinaSchool of Electrical Engineering and Computer Science, The University of Newcastle NSW 2308, AustraliaMass data processing and complex problem solving have higher and higher demands for performance of multiprocessor systems. Many multiprocessor systems have interconnection networks as underlying topologies. The interconnection network determines the performance of a multiprocessor system. The network is usually represented by a graph where nodes (vertices) represent processors and links (edges) represent communication links between processors. For the network G, two vertices u and v of G are said to be connected if there is a (u,v)-path in G. If G has exactly one component, then G is connected; otherwise G is disconnected. In the system where the processors and their communication links to each other are likely to fail, it is important to consider the fault tolerance of the network. For a connected network G=(V,E), its inverse problem is that G-F is disconnected, where F⊆V or F⊆E. The connectivity or edge connectivity is the minimum number of F. Connectivity plays an important role in measuring the fault tolerance of the network. As a topology structure of interconnection networks, the expanded k-ary n-cube XQnk has many good properties. In this paper, we prove that (1) XQnk is super edge-connected (n≥3); (2) the restricted edge connectivity of XQnk is 8n-2 (n≥3); (3) XQnk is super restricted edge-connected (n≥3).http://dx.doi.org/10.1155/2018/7867342 |
| spellingShingle | Shiying Wang Mujiangshan Wang The Edge Connectivity of Expanded k-Ary n-Cubes Discrete Dynamics in Nature and Society |
| title | The Edge Connectivity of Expanded k-Ary n-Cubes |
| title_full | The Edge Connectivity of Expanded k-Ary n-Cubes |
| title_fullStr | The Edge Connectivity of Expanded k-Ary n-Cubes |
| title_full_unstemmed | The Edge Connectivity of Expanded k-Ary n-Cubes |
| title_short | The Edge Connectivity of Expanded k-Ary n-Cubes |
| title_sort | edge connectivity of expanded k ary n cubes |
| url | http://dx.doi.org/10.1155/2018/7867342 |
| work_keys_str_mv | AT shiyingwang theedgeconnectivityofexpandedkaryncubes AT mujiangshanwang theedgeconnectivityofexpandedkaryncubes AT shiyingwang edgeconnectivityofexpandedkaryncubes AT mujiangshanwang edgeconnectivityofexpandedkaryncubes |