On distance-regular graphs with Ki = kj
Let be a distance regular graph with diameter d and valency k. For nonnegative integers i and j, with 0 i + j d and vertices u, v E , letki = number of points at distance i from u and kj = number of points at distance j from v. This thesis is a detailed study about distance regular graphs satisfying...
Saved in:
| Main Author: | |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
1994
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_masteral/1643 https://animorepository.dlsu.edu.ph/context/etd_masteral/article/8481/viewcontent/TG02363_F_Redacted.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |