3-bounded property in a triangle-free distance-regular graph
| dc.creator | Pan, Yeh-jong | |
| dc.creator | Weng, Chih-wen | |
| dc.date | 2007-09-05 | |
| dc.date.accessioned | 2026-07-07T08:27:43Z | |
| dc.date.available | 2026-07-07T08:27:43Z | |
| dc.description | Let $Γ$ denote a distance-regular graph with classical parameters $(D, b, α, β)$ and $D\geq 3$. Assume the intersection numbers $a_1=0$ and $a_2\not=0$. We show $Γ$ is 3-bounded in the sense of the article [D-bounded distance-regular graphs, European Journal of Combinatorics(1997)18, 211-229]. | |
| dc.description | 13 pages | |
| dc.identifier | https://arxiv.org/abs/0709.0564 | |
| dc.identifier | http://arxiv.org/abs/0709.0564 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/137364 | |
| dc.subject | Combinatorics | |
| dc.title | 3-bounded property in a triangle-free distance-regular graph | |
| dc.type | text |