Distance-regular graphs with intersection arrays \(\{52, 35, 16; 1, 4, 28\}\) and \(\{69, 48, 24; 1, 4, 46\}\) do not exist

DOI10.1007/s10623-012-9695-1zbMath1245.05035OpenAlexW2076405271MaRDI QIDQ438891

Alexander L. Gavrilyuk, Aleksandr Alekseevich Makhnev

Publication date: 31 July 2012

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-012-9695-1

zbMATH Keywords

distance-regular graphintersection arrayTerwilliger graph

Mathematics Subject Classification ID

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

Related Items (2)

Inverse problems in the theory of distance-regular graphs ⋮ The Koolen-Park boundary and distance-regular graphs without \(m\)-claws

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance-regular graphs with intersection arrays \(\{55, 36, 11; 1, 4, 45\}\) and \(\{56, 36, 9; 1, 3, 48\}\) do not exist
• Shilla distance-regular graphs
• On the Koolen-Park inequality and Terwilliger graphs
• Distance-regular graph with the intersection array {45, 30, 7; 1, 2, 27} does not exist

This page was built for publication: Distance-regular graphs with intersection arrays \(\{52, 35, 16; 1, 4, 28\}\) and \(\{69, 48, 24; 1, 4, 46\}\) do not exist