Abstract
In this paper, we will show that there does not exist a distance-regular graph Γ with intersection array { 80 , 54 , 12 ; 1 , 6 , 60 }. We first show that a local graph Δ of Γ does not contain a coclique with 5 vertices, and then we prove that the graph Γ is geometric by showing that Δ consists of 4 disjoint cliques with 20 vertices. Then we apply a result of Koolen and Bang to the graph Γ , and we could obtain that there is no such a distance-regular graph.
| Original language | English |
|---|---|
| Pages (from-to) | 1597-1608 |
| Number of pages | 12 |
| Journal | Graphs and Combinatorics |
| Volume | 35 |
| Issue number | 6 |
| DOIs | |
| State | Published - 1 Nov 2019 |
Keywords
- Delsarte cliques
- Distance-regular graphs
- Geometric distance-regular graphs
- The claw-bound
Fingerprint
Dive into the research topics of 'There Does Not Exist a Distance-Regular Graph with Intersection Array { 80 , 54 , 12 ; 1 , 6 , 60 }'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver