Academic Journal
On the two-equal-disjoint path cover problem of crossed cubes
| العنوان: | On the two-equal-disjoint path cover problem of crossed cubes |
|---|---|
| المؤلفون: | Pao-lien Lai, Hong-chun Hsu |
| المساهمون: | The Pennsylvania State University CiteSeerX Archives |
| المصدر: | http://140.119.218.190/upload/9010.pdf. |
| سنة النشر: | 2006 |
| المجموعة: | CiteSeerX |
| مصطلحات موضوعية: | path, k-equal-disjoint path cover |
| الوصف: | 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 (x,y) of G, there exist two disjoint paths Puv and Pxy satisfied that (1) Puv joins u to v and Pxy � joins x to y, (2) |Puv | = |Pxy|, and (3) V (Pxy Pxy) = V (G). In this paper, we prove that TQn is globally 2-equal-disjoint path coverable for n ≥ 5. |
| نوع الوثيقة: | text |
| وصف الملف: | application/pdf |
| اللغة: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.2254; http://140.119.218.190/upload/9010.pdf |
| الاتاحة: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.2254 http://140.119.218.190/upload/9010.pdf |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| رقم الانضمام: | edsbas.31019EBD |
| قاعدة البيانات: | BASE |
| الوصف غير متاح. |