Toward the One-to-Two Balanced Disjoint-Path Cover of Matching Composition Networks

• Main Authors: Wang, Chi-Lun, 王啓倫
• Other Authors: Hsu, Lih-Hsing
• Format: Others
• Language: en_US
• Published: 2015
• Online Access: http://ndltd.ncl.edu.tw/handle/32045154540238020629

碩士 === 靜宜大學 === 資訊工程學系 === 103 === A one-to-two disjoint-path cover of a graph G is a pair (P1, P2) of two vertex-disjoint paths that connect one source to two sinks in G and span G. It is called ε-balanced if |ℓ(P1)−ℓ(P2)| =ε, where ℓ(P1) and ℓ(P2) denote the lengths of paths P1 and P2, respectively. The matching composition network is a family of interconnection networks, each of which connects two components with the same number of vertices by a perfect matching. This paper addresses some properties about one-to-two disjoint-path covers of matching composition networks. Applying the proposed main theorem, a one-to-two ε-balanced disjoint-path cover in some well-known interconnection networks, such as crossed cubes, twisted cubes, locally twisted cubes, etc., can be easily obtained for a given odd integer ε.