A remark on the intersection arrays of distance-regular graphs
From MaRDI portal
Publication:1077433
DOI10.1016/0095-8956(88)90084-6zbMath0595.05048OpenAlexW2030736435MaRDI QIDQ1077433
Alan Boshier, Nomura, Kazumasa
Publication date: 1988
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(88)90084-6
Related Items
On local structure of a distance-regular graph of Hamming type ⋮ On strongly closed subgraphs of highly regular graphs ⋮ Distance-regular graphs with \(\Gamma(x) \simeq 3* K_{a+1}\) ⋮ Distance-regular graphs of Hamming type ⋮ Intersection diagrams of distance-biregular graphs ⋮ Distance-regular subgraphs in a distance-regular graph. I ⋮ Distance-regular subgraphs in a distance-regular graph. II ⋮ On distance-regular graphs with height two ⋮ On distance-regular graphs with \(k_ i= k_ j\). II ⋮ A remark on Mulder's conjecture about interval-regular graphs ⋮ A constant bound on the number of columns \((1,k-2,1)\) in the intersection array of a distance-regular graph ⋮ On distance-regular graphs with fixed valency. IV ⋮ A remark on the intersection arrays of distance regular graphs and the distance regular graphs of diameter \(d=3i -1\) with \(b_ i =1\) and \(k>2\) ⋮ The regular near polygons of order \((s,2)\) ⋮ Applications of the retracing method for distance-regular graphs ⋮ Distance-regular graphs of valency 6 and \(a_1=1\) ⋮ The distance-regular graphs of valency four ⋮ Retracing argument for distance-regular graphs ⋮ An improvement of the Ivanov bound ⋮ An application of intersection diagrams of high rank ⋮ On distance-biregular graphs of girth divisible by four ⋮ An inequality between intersection numbers of a distance-regular graph
Cites Work
