On distance regular graphs with b1=cd-1
Let be a Distance Regular Graph with diameter d and valency k. This paper proves the following result:Supposeb1 = cd-ab2 = cd-2bi = cd-ifor some i 1. Then the following hold:1. bd-1=c1' bd-2 = c2' ... , bd-i=ci 2. If a = ad = 0 , then k = a (a + 1) b1= ... = b12= a and 1 = c1 = ... ci = ci...
محفوظ في:
| المؤلفون الرئيسيون: | , |
|---|---|
| التنسيق: | text |
| اللغة: | English |
| منشور في: |
Animo Repository
1994
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://animorepository.dlsu.edu.ph/etd_bachelors/16165 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | Let be a Distance Regular Graph with diameter d and valency k. This paper proves the following result:Supposeb1 = cd-ab2 = cd-2bi = cd-ifor some i 1. Then the following hold:1. bd-1=c1' bd-2 = c2' ... , bd-i=ci 2. If a = ad = 0 , then k = a (a + 1) b1= ... = b12= a and 1 = c1 = ... ci = ci+1Moreover, ifb1 = cj with j d, then bj |
|---|