کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4649698 | 1342464 | 2008 | 9 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Lattices generated by join of strongly closed subgraphs in d-bounded distance-regular graphs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Lattices generated by join of strongly closed subgraphs in d-bounded distance-regular graphs Lattices generated by join of strongly closed subgraphs in d-bounded distance-regular graphs](/preview/png/4649698.png)
چکیده انگلیسی
Let ΓΓ be a d -bounded distance-regular graph with diameter d⩾3d⩾3. Suppose that P(x)P(x) is a set of all strongly closed subgraphs containing x and that P(x,i)P(x,i) is a subset of P(x)P(x) consisting of all elements of P(x)P(x) with diameter i . Let L′(x,i)L′(x,i) be the set generated by all joins of the elements in P(x,i)P(x,i). By ordering L′(x,i)L′(x,i) by inclusion or reverse inclusion, L′(x,i)L′(x,i) is denoted by LO′(x,i) or LR′(x,i). We prove that LO′(x,i) and LR′(x,i) are both finite atomic lattices, and give the conditions for them both being geometric lattices. We also give the eigenpolynomial of LO′(x,i).
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 308, Issue 10, 28 May 2008, Pages 1921–1929
Journal: Discrete Mathematics - Volume 308, Issue 10, 28 May 2008, Pages 1921–1929
نویسندگان
Jun Guo, Suogang Gao,