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...
Saved in:
Main Authors: | Cadorniga, Esteinitz G., Monteverde, Marlon F. |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
1994
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/16165 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
Similar Items
-
On distance-regular graphs with Be=1
by: Ramos, Juanita Agbada
Published: (1996) -
On distance-regular graphs with ki=kj, II
by: Talamayan, Cecil Lelis
Published: (1997) -
Tight distance-regular graphs and the subconstituent algebra
by: Go, Junie T., et al.
Published: (2002) -
The terwilliger algebra of a distance-regular graph
by: Go, Junie T.
Published: (1999) -
On chromatic polynomials of regular graphs and modified wheels
by: Aves, Lovelina A.
Published: (1994)