ملخص
Arrangement graphs have been recently proposed as an attractive interconnection topology for large multiprocessor systems. In this correspondence, we further study these graphs by first proving the existence of Hamiltonian cycles in any arrangement graph. Secondly, we prove that an arrangement graph contains cycles of all lengths ranging between 3 and the size of the graph. Finally, we show that an arrangement graph can be decomposed into node disjoint cycles in many different ways.
اللغة الأصلية | English |
---|---|
الصفحات (من إلى) | 1002-1006 |
عدد الصفحات | 5 |
دورية | IEEE Transactions on Computers |
مستوى الصوت | 42 |
رقم الإصدار | 8 |
المعرِّفات الرقمية للأشياء | |
حالة النشر | Published - أغسطس 1993 |
منشور خارجيًا | نعم |
ASJC Scopus subject areas
- ???subjectarea.asjc.1700.1712???
- ???subjectarea.asjc.2600.2614???
- ???subjectarea.asjc.1700.1708???
- ???subjectarea.asjc.1700.1703???