3-bounded property in a triangle-free distance-regular graph
classification
🧮 math.CO
keywords
distance-regularboundedgammagraphalphaarticleassumebeta
read the original abstract
Let $\Gamma$ denote a distance-regular graph with classical parameters $(D, b, \alpha, \beta)$ and $D\geq 3$. Assume the intersection numbers $a_1=0$ and $a_2\not=0$. We show $\Gamma$ is 3-bounded in the sense of the article [D-bounded distance-regular graphs, European Journal of Combinatorics(1997)18, 211-229].
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.