Shilla distance-regular graphs
| dc.creator | Koolen, Jack H. | |
| dc.creator | Park, Jongyook | |
| dc.date | 2009-02-23 | |
| dc.date.accessioned | 2026-07-07T12:45:35Z | |
| dc.date.available | 2026-07-07T12:45:35Z | |
| dc.description | A Shilla distance-regular graph G (say with valency k) is a distance-regular graph with diameter 3 such that its second largest eigenvalue equals to a3. We will show that a3 divides k for a Shilla distance-regular graph G, and for G we define b=b(G):=k/a3. In this paper we will show that there are finitely many Shilla distance-regular graphs G with fixed b(G)>=2. Also, we will classify Shilla distance-regular graphs with b(G)=2 and b(G)=3. Furthermore, we will give a new existence condition for distance-regular graphs, in general. | |
| dc.description | 14 pages | |
| dc.identifier | https://arxiv.org/abs/0902.3860 | |
| dc.identifier | http://arxiv.org/abs/0902.3860 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/221132 | |
| dc.subject | Combinatorics | |
| dc.subject | 05E30 | |
| dc.title | Shilla distance-regular graphs | |
| dc.type | text |