Distance-regular graphs with intersection arrays \(\{55, 36, 11; 1, 4, 45\}\) and \(\{56, 36, 9; 1, 3, 48\}\) do not exist
From MaRDI portal
Publication:656371
DOI10.1134/S1064562411040028zbMath1283.05232MaRDI QIDQ656371
Publication date: 17 January 2012
Published in: Doklady Mathematics (Search for Journal in Brave)
Association schemes, strongly regular graphs (05E30) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)
Related Items (2)
The Koolen-Park boundary and distance-regular graphs without \(m\)-claws ⋮ Distance-regular graphs with intersection arrays \(\{52, 35, 16; 1, 4, 28\}\) and \(\{69, 48, 24; 1, 4, 46\}\) do not exist
Cites Work
This page was built for publication: Distance-regular graphs with intersection arrays \(\{55, 36, 11; 1, 4, 45\}\) and \(\{56, 36, 9; 1, 3, 48\}\) do not exist
