| Autor: |
Yanze Huang, Limei Lin, Dajin Wang, Li Xu |
| Jazyk: |
angličtina |
| Rok vydání: |
2019 |
| Předmět: |
|
| Zdroj: |
IEEE Access, Vol 7, Pp 17299-17311 (2019) |
| Druh dokumentu: |
article |
| ISSN: |
2169-3536 |
| DOI: |
10.1109/ACCESS.2019.2896101 |
| Popis: |
The minimum neighborhood and combinatorial property are two important indicators of fault tolerance of a multiprocessor system. Given a graph G, θG(q) is the minimum number of vertices adjacent to a set of q vertices of G (1 ≤ q ≤ |V(G)|). It is meant to determine θG(q), the minimum neighborhood problem (MNP). In this paper, we obtain θAG0(q) for an independent set with size q in an n-dimensional alternating group graph AGn, a well-known interconnection network for multiprocessor systems. We first propose some combinatorial properties of AGn. Then, we study the MNP for an independent set of two vertices and obtain that θAGn(2) = 4n - 10. Next, we prove that θAGn(3) = 6n -16. Finally, we propose that θAGn(4) = 8n - 24. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
