کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10118318 | 1632849 | 2005 | 16 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
De Bruijn digraphs and affine transformations
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Let Zdn be the additive group of 1Ãn row vectors over Zd. For an nÃn matrix T over Zd and ÏâZdn, the affine transformation FT,Ï of Zdn sends x to xT+Ï. Let ãαã be the cyclic group generated by a vector αâZdn. The affine transformation coset pseudo-digraph TCP(Zdn,α,FT,Ï) has the set of cosets of ãαã in Zdn as vertices and there are c arcs from x+ãαã to y+ãαã if and only if the number of zâx+ãαã such that FT,Ï(z)ây+ãαã is c. We prove that the following statements are equivalent: (a) TCP(Zdn,α,FT,Ï) is isomorphic to the d-nary (nâ1)-dimensional De Bruijn digraph; (b) α is a cyclic vector for T; (c) TCP(Zdn,α,FT,Ï) is primitive. This strengthens a result conjectured by C.M. Fiduccia and E.M. Jacobson [Universal multistage networks via linear permutations, in: Proceedings of the 1991 ACM/IEEE Conference on Supercomputing, ACM Press, New York, 1991, pp. 380-389]. Under the further assumption that T is invertible we show that each component of TCP(Zdn,α,FT,Ï) is a conjunction of a cycle and a De Bruijn digraph, namely a generalized wrapped butterfly. Finally, we discuss the affine TCP digraph representations for a class of digraphs introduced by D. Coudert, A. Ferreira and S. Perennes [Isomorphisms of the De Bruijn digraph and free-space optical networks, Networks 40 (2002) 155-164].
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Combinatorics - Volume 26, Issue 8, November 2005, Pages 1191-1206
Journal: European Journal of Combinatorics - Volume 26, Issue 8, November 2005, Pages 1191-1206
نویسندگان
Aiping Deng, Yaokun Wu,