TY - JOUR
T1 - Neighbor Connectivity of the Alternating Group Graph
AU - Abdallah, Mohamad
AU - Hung, Chun Nan
N1 - Abdallah, M., & Hung,C.-N. (2021). Neighbor Connectivity of the Alternating Group Graph. Journal ofInterconnection Networks, 21(03). https://doi.org/10.1142/S0219265921500146
PY - 2021/9/1
Y1 - 2021/9/1
N2 - Given a graph G = (V,E), its neighbor connectivity is the least number of vertices whose deletion along with their neighbors results in a disconnected, complete, or empty graph. The edge neighbor connectivity is the least number of edges whose deletion along with their endpoints results in a disconnected, complete, or empty graph. In this paper, we determine the neighbor connectivity κNB and the edge neighbor connectivity λNB of the alternating group graph. We show that κNB(AGn) = λNB(AGn) = n - 2, where AGn is the n-dimensional alternating group graph.
AB - Given a graph G = (V,E), its neighbor connectivity is the least number of vertices whose deletion along with their neighbors results in a disconnected, complete, or empty graph. The edge neighbor connectivity is the least number of edges whose deletion along with their endpoints results in a disconnected, complete, or empty graph. In this paper, we determine the neighbor connectivity κNB and the edge neighbor connectivity λNB of the alternating group graph. We show that κNB(AGn) = λNB(AGn) = n - 2, where AGn is the n-dimensional alternating group graph.
KW - alternating group graph
KW - Connectivity
KW - neighbor connectivity
UR - https://www.scopus.com/pages/publications/85112665234
U2 - 10.1142/S0219265921500146
DO - 10.1142/S0219265921500146
M3 - Article
SN - 0219-2659
VL - 21
JO - Journal of Interconnection Networks
JF - Journal of Interconnection Networks
IS - 3
M1 - 2150014
ER -