Open Access
Open access
IEEE Access, volume 7, pages 17299-17311

Minimum Neighborhood of Alternating Group Graphs

Publication typeJournal Article
Publication date2019-01-30
Journal: IEEE Access
Q1
Q2
SJR0.960
CiteScore9.8
Impact factor3.4
ISSN21693536
General Materials Science
General Engineering
General Computer Science
Abstract
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.
Found 
Found 

Top-30

Journals

1
Frontiers of Computer Science
1 publication, 16.67%
Applied Mathematics and Computation
1 publication, 16.67%
IEEE Transactions on Parallel and Distributed Systems
1 publication, 16.67%
IEEE Access
1 publication, 16.67%
IEEE Transactions on Reliability
1 publication, 16.67%
Parallel Processing Letters
1 publication, 16.67%
1

Publishers

1
2
3
Institute of Electrical and Electronics Engineers (IEEE)
3 publications, 50%
Springer Nature
1 publication, 16.67%
Elsevier
1 publication, 16.67%
World Scientific
1 publication, 16.67%
1
2
3
  • We do not take into account publications without a DOI.
  • Statistics recalculated only for publications connected to researchers, organizations and labs registered on the platform.
  • Statistics recalculated weekly.

Are you a researcher?

Create a profile to get free access to personal recommendations for colleagues and new articles.
Metrics
Share
Cite this
GOST |
Cite this
GOST Copy
Huang Y. et al. Minimum Neighborhood of Alternating Group Graphs // IEEE Access. 2019. Vol. 7. pp. 17299-17311.
GOST all authors (up to 50) Copy
Huang Y., Lin L., WANG D., Xu L. Minimum Neighborhood of Alternating Group Graphs // IEEE Access. 2019. Vol. 7. pp. 17299-17311.
RIS |
Cite this
RIS Copy
TY - JOUR
DO - 10.1109/access.2019.2896101
UR - https://doi.org/10.1109/access.2019.2896101
TI - Minimum Neighborhood of Alternating Group Graphs
T2 - IEEE Access
AU - Huang, Yanze
AU - Lin, Limei
AU - WANG, DAJIN
AU - Xu, Li
PY - 2019
DA - 2019/01/30
PB - Institute of Electrical and Electronics Engineers (IEEE)
SP - 17299-17311
VL - 7
SN - 2169-3536
ER -
BibTex
Cite this
BibTex (up to 50 authors) Copy
@article{2019_Huang,
author = {Yanze Huang and Limei Lin and DAJIN WANG and Li Xu},
title = {Minimum Neighborhood of Alternating Group Graphs},
journal = {IEEE Access},
year = {2019},
volume = {7},
publisher = {Institute of Electrical and Electronics Engineers (IEEE)},
month = {jan},
url = {https://doi.org/10.1109/access.2019.2896101},
pages = {17299--17311},
doi = {10.1109/access.2019.2896101}
}
Found error?