There exists no distance-regular graph with intersection array \((5,4,3;1,1,2)\)

DOI10.1006/eujc.1993.1045zbMath0794.05132OpenAlexW2047473850MaRDI QIDQ1322408

Dmitry G. Fon-Der-Flaass

Publication date: 16 August 1994

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.1993.1045

zbMATH Keywords

distance-regular graphintersection array

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12)

Related Items (8)

On 3-chromatic distance-regular graphs ⋮ Distance-regularity and the spectrum of graphs ⋮ A valency bound for distance-regular graphs ⋮ Max-cut and extendability of matchings in distance-regular graphs ⋮ A distance-regular graph with intersection array (5,4,3,3; 1,1,1,2) does not exist ⋮ On large (Δ, D, D, 1)-graphs ⋮ Three-class association schemes ⋮ Distance-regular graphs of diameter 3 without triangles with \(c_2=2\)

This page was built for publication: There exists no distance-regular graph with intersection array \((5,4,3;1,1,2)\)