The two-equal-disjoint path cover problem of Matching Composition Network
In: Information processing letters, Jg. 107 (2008), Heft 1, S. 18-23
academicJournal
- print, 15 ref
Zugriff:
Embedding of paths have attracted much attention in the parallel processing. Many-to-many communication is one of the most central issues in various interconnection networks. A graph G is globally two-equal-disjoint path coverable if for any two distinct pairs of vertices (u, v) and (w, x) of G, there exist two disjoint paths P and Q satisfied that (1) P (Q, respectively) joins u and v (w and x, respectively), (2) |P| = |Q|, and (3) V(P U Q) = V(G). The Matching Composition Network (MCN) is a family of networks which two components are connected by a perfect matching. In this paper, we consider the globally two-equal-disjoint path cover property of MCN. Applying our result, the Crossed cube CQn, the Twisted cube TQn, and the Mobius cube MQn can all be proven to be globally two-equal-disjoint path coverable for n ≥ 5.
Titel: |
The two-equal-disjoint path cover problem of Matching Composition Network
|
---|---|
Autor/in / Beteiligte Person: | LAI, Pao-Lien ; HSU, Hong-Chun |
Link: | |
Zeitschrift: | Information processing letters, Jg. 107 (2008), Heft 1, S. 18-23 |
Veröffentlichung: | Amsterdam: Elsevier Science, 2008 |
Medientyp: | academicJournal |
Umfang: | print, 15 ref |
ISSN: | 0020-0190 (print) |
Schlagwort: |
|
Sonstiges: |
|