کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9515953 | 1343748 | 2005 | 24 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
1-homogeneous, pseudo-1-homogeneous, and 1-thin distance-regular graphs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
Finally, we use these decompositions to describe a related family of distance-regular graphs. Let L denote a minimal left ideal of T. Then L is said to be thin if dimEi*L⩽1(0⩽i⩽d). The endpoint of L is min{i|Ei*Lâ 0}. The graph Î is said to be 1-thin with respect to x when every minimal left ideal of T with endpoint 1 is thin. It is known that Î is 1-thin with respect to x with a unique minimal left ideal of endpoint 1 if and only if Î is bipartite or almost bipartite (in either case Î is 1-homogeneous with respect to x). We show that Î is 1-thin with respect to x with exactly two minimal left ideals of endpoint 1 if and only if Î is pseudo-1-homogeneous with respect to x and the intersection number a1 is nonzero.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Combinatorial Theory, Series B - Volume 93, Issue 2, March 2005, Pages 279-302
Journal: Journal of Combinatorial Theory, Series B - Volume 93, Issue 2, March 2005, Pages 279-302
نویسندگان
Brian Curtin, Kazumasa Nomura,