On tight distance-regular graphs
This thesis is an expository work taken from Sections 1-8 of the paper entitled Tight Distance-Regular Graphs by Aleksandar Jurisic, Jack Koolen, and Paul Terwilliger which will appear in the Journal of Algebraic Combinatorics. It focuses on the following result: Let T = (X, R) be a distance-regular...
Saved in:
Main Author: | Sinlao, Rowena A. |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
2000
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_masteral/2502 https://animorepository.dlsu.edu.ph/context/etd_masteral/article/9340/viewcontent/TG03114_F_Partial.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
Similar Items
-
A generalization to tight distance-regular graphs of Curtin's result on bipartite graphs
by: Pascasio, Arlene A.
Published: (1998) -
On distance regular graphs with height two, II
by: Dulay, Teresita Basiao
Published: (1999) -
On distance-biregular graphs
by: Mateo, Rolando A.
Published: (2002) -
Augmenting the Delsarte bound: a forbidden interval for the order of maximal cliques in strongly regular graphs
by: Greaves, Gary Royden Watson, et al.
Published: (2022) -
On the Wiener and Harary index of splitting graphs
by: Egan, Ma. Christine G.
Published: (2022)