One-to-one disjoint path covers on alternating group graphs
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
| Original language | English |
|---|---|
| Pages (from-to) | 146-164 |
| Journal / Publication | Theoretical Computer Science |
| Volume | 562 |
| Issue number | C |
| Publication status | Published - 2015 |
Link(s)
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.
Research Area(s)
- Alternating group graph, Interconnection network, One-to-one disjoint path covers, Parallel computing
Citation Format(s)
One-to-one disjoint path covers on alternating group graphs. / You, Lantao; Fan, Jianxi; Han, Yuejuan et al.
In: Theoretical Computer Science, Vol. 562, No. C, 2015, p. 146-164.
In: Theoretical Computer Science, Vol. 562, No. C, 2015, p. 146-164.
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
