On distance-regular graphs and (s,c,a,k)-graphs
This thesis is an exposition of the paper of Paul Terwilliger entitled Distance-Regular Graphs and (s, c, a, k)-Graphs . In this paper, the following are presented: 1. A diameter bound theorem for a class of distance-regular graphs which includes all those with even girth. 2. A new class of graphs,...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | text |
| 語言: | English |
| 出版: |
Animo Repository
1998
|
| 主題: | |
| 在線閱讀: | https://animorepository.dlsu.edu.ph/etd_masteral/1949 https://animorepository.dlsu.edu.ph/context/etd_masteral/article/8787/viewcontent/TG02827_F_Partial.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | This thesis is an exposition of the paper of Paul Terwilliger entitled Distance-Regular Graphs and (s, c, a, k)-Graphs . In this paper, the following are presented: 1. A diameter bound theorem for a class of distance-regular graphs which includes all those with even girth. 2. A new class of graphs, called (s, c, a, k)-graphs, which are conjectured to contain enough of the local structure of finite distance-regular graphs for them to be all finite. 3. A (s, c, a, k)-graph is finite and a bound on the diameter is given if a - c. |
|---|