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-1zbMATH Open1245.05035OpenAlexW2076405271MaRDI QIDQ438891FDOQ438891

Authors: Alexander L. Gavrilyuk, Alexandre A. 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

Recommendations

• ON THE NON-EXISTENCE OF CERTAIN DISTANCE-REULAR GRAPHS
• Distance-regular graphs with intersection arrays \(\{42,30,12;1,6,28\}\) and \(\{60,45,8;1,12,50\}\) do not exist
• A distance regular graph with intersection array \((21,16,8;1,4,14)\) does not exist
• There does not exist a distance-regular graph with intersection array \(\{80, 54,12; 1, 6, 60\}\)
• The nonexistence of a distance-regular graph with intersection array \(\{22,16,5;1,2,20\}\)

zbMATH Keywords

distance-regular graphintersection arrayTerwilliger graph

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Distance-regular graphs with intersection arrays \(\{55, 36, 11; 1, 4, 45\}\) and \(\{56, 36, 9; 1, 3, 48\}\) do not exist

Cited In (11)

• A distance-regular graph with intersection array (5,4,3,3; 1,1,1,2) does not exist
• Title not available (Why is that?)
• A distance regular graph with intersection array \((21,16,8;1,4,14)\) does not exist
• Distance-regular graphs with intersection arrays \(\{42,30,12;1,6,28\}\) and \(\{60,45,8;1,12,50\}\) do not exist
• Distance-regular graph with the intersection array \(\{45, 30, 7; 1, 2, 27\}\) does not exist
• On nonexistence of distance regular graphs with the intersection array ${53,40,28,16;1,4,10,28}$
• There does not exist a distance-regular graph with intersection array \(\{80, 54,12; 1, 6, 60\}\)
• Distance-regular Terwilliger graphs with intersection arrays \(\{50,42,1;1,2,50\}\) and \(\{50,42,9;1,2,42\}\) do not exist
• Inverse problems in the theory of distance-regular graphs
• Distance-regular graphs with intersection array \(\{69,56,10;1,14,60\}\), \(\{74,54,15;1,9,60\}\) and \(\{119,100,15;1,20,105\}\) do not exist
• The Koolen-Park boundary and distance-regular graphs without \(m\)-claws

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q438891)