The One-to-One Disjoint Path Cover of k-ary n-cubes when k is odd
碩士 === 中原大學 === 應用數學研究所 === 97 === The k-ary n-cube, , is one of the most popular interconnection networks. In this thesis, we prove that given any two distinct vertices u, v of , there exist 2n internally disjoint paths between u and v, denoted by﹛ ︳0 ﹜, such that covers all vertices of . The...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/56069305312879822432 |