On distance-regular graphs with fixed valency. IV
From MaRDI portal
Publication:1123215
DOI10.1016/S0195-6698(89)80041-1zbMath0677.05061OpenAlexW1980707929MaRDI QIDQ1123215
Publication date: 1989
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0195-6698(89)80041-1
Related Items (12)
Two theorems concerning the Bannai-Ito conjecture ⋮ On distance-regular graphs with \(k_ i= k_ j\). II ⋮ A bound for the number of columns \(\ell_{(c,a,b)}\) in the intersection array of a distance-regular graph ⋮ Finite analogues of non-Euclidean spaces and Ramanujan graphs. ⋮ There are only finitely many distance-regular graphs of fixed valency greater than two ⋮ Bounding the diameter of a distance regular graph by a function of \(k_ d\) ⋮ On the Calculation of Multiplicities forP-PolynomialC-Algebras ⋮ There are finitely many triangle-free distance-regular graphs with degree 8, 9 or 10 ⋮ Table algebras ⋮ Distance-regular graphs of valency 6 and \(a_1=1\) ⋮ The distance-regular graphs of valency four ⋮ On a conjecture of Bannai and Ito: There are finitely many distance-regular graphs with degree 5, 6 or 7
Cites Work
This page was built for publication: On distance-regular graphs with fixed valency. IV
