TY - JOUR
T1 - One-to-one disjoint path covers on alternating group graphs
AU - You, Lantao
AU - Fan, Jianxi
AU - Han, Yuejuan
AU - Jia, Xiaohua
PY - 2015
Y1 - 2015
N2 - The alternating group graph, denoted by AGn, is one of the popular interconnection networks, which has many attractive properties. In this paper, we prove that for any two distinct nodes μ and ν, there exist m node-disjoint paths for any integer n≥3 with 1≤m≤2n-4 whose union covers all the nodes of AGn. For any node of AGn has exactly 2n-4 neighbors, 2n-4 is the maximum number of node-disjoint paths can be constructed in AGn.
AB - The alternating group graph, denoted by AGn, is one of the popular interconnection networks, which has many attractive properties. In this paper, we prove that for any two distinct nodes μ and ν, there exist m node-disjoint paths for any integer n≥3 with 1≤m≤2n-4 whose union covers all the nodes of AGn. For any node of AGn has exactly 2n-4 neighbors, 2n-4 is the maximum number of node-disjoint paths can be constructed in AGn.
KW - Alternating group graph
KW - Interconnection network
KW - One-to-one disjoint path covers
KW - Parallel computing
UR - http://www.scopus.com/inward/record.url?scp=84926311954&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84926311954&origin=recordpage
U2 - 10.1016/j.tcs.2014.09.041
DO - 10.1016/j.tcs.2014.09.041
M3 - 21_Publication in refereed journal
VL - 562
SP - 146
EP - 164
JO - Theoretical Computer Science
JF - Theoretical Computer Science
SN - 0304-3975
IS - C
ER -