On an improvement of the Boshier-Nomura bound
Let be a Distance Regular Graph with Intersection Array* 1 1 1 11 ... 1...k k - 1 k - 1 k - 2 k - 2This thesis shows that if r 0 then s 4. An earlier result by A. Boshier and K. Nomura states that s 4 if r 0.
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
1994
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/16171 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |
| Summary: | Let be a Distance Regular Graph with Intersection Array* 1 1 1 11 ... 1...k k - 1 k - 1 k - 2 k - 2This thesis shows that if r 0 then s 4. An earlier result by A. Boshier and K. Nomura states that s 4 if r 0. |
|---|