@article{7f5b228502da4919a5be9f0c3fed50cd, title = "One-to-one disjoint path covers on alternating group graphs", abstract = "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.", keywords = "Alternating group graph, Interconnection network, One-to-one disjoint path covers, Parallel computing", author = "Lantao You and Jianxi Fan and Yuejuan Han and Xiaohua Jia", year = "2015", doi = "10.1016/j.tcs.2014.09.041", language = "English", volume = "562", pages = "146--164", journal = "Theoretical Computer Science", issn = "0304-3975", publisher = "ELSEVIER SCIENCE BV", number = "C", }