Distance-regular graph with intersection array \143,108,27;1,12,117\ does not exist

DOI10.33048/SEMI.2023.20.017MaRDI QIDQ6587377zbMATH OpenFDO

Authors Alexandre A. Makhnev, M. M. Isakova, Albina Aniuarovna Tokbaeva

Publication date 14 August 2024

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL https://doi.org/10.33048/SEMI.2023.20.017

zbMATH Keywords

distance-regular graphformally self-dual graphtriple intersection numbers

Mathematics Subject Classification ID

Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Association schemes, strongly regular graphs (05E30)

Recommendations

• A distance regular graph with intersection array \((21,16,8;1,4,14)\) does not exist
• Distance-Regular Graphs with Intersection Arrays {7,6,6;1,1,2} and {42,30,2;1,10,36} Do not Exist
• ON THE NON-EXISTENCE OF CERTAIN DISTANCE-REULAR 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
• There does not exist a distance-regular graph with intersection array \(\{80, 54,12; 1, 6, 60\}\)

Cites work

• Extremal 1-codes in distance-regular graphs of diameter 3
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• On Q-polynomial distance-regular graphs with strongly regular graphs _2 and _3
• Restrictions on classical distance-regular graphs
• The nonexistence small Q-polynomial graphs of type (III)

This page was built for publication: Distance-regular graph with intersection array \(\{143,108,27;1,12,117\}\) does not exist

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