Abstract
In 2013, it was shown that, for a given real number α>2, there are only finitely many distance-regular graphs Γ with valency k and diameter D≥3 having at most αk vertices, except for the following two cases: (i) D=3 and Γ is imprimitive; (ii) D=4 and Γ is antipodal and bipartite. In this paper, we will generalize this result to 2-walk-regular graphs. In this case, also incidence graphs of certain group divisible designs appear.
| Original language | English |
|---|---|
| Pages (from-to) | 10-24 |
| Number of pages | 15 |
| Journal | Linear Algebra and Its Applications |
| Volume | 510 |
| DOIs | |
| State | Published - 1 Dec 2016 |
Keywords
- Distance-regular graphs
- Dual property
- Group divisible designs
- t-walk-regular graphs
Fingerprint
Dive into the research topics of '2-Walk-regular graphs with a small number of vertices compared to the valency'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver