ON THE NON-EXISTENCE OF CERTAIN DISTANCE-REULAR GRAPHS

DOI10.2206/KYUSHUJM.53.1MaRDI QIDQ4254072zbMATH OpenOpenAlexFDO

Authors Yuelan Chen, Akira Hiraki

Publication date 28 June 1999

Published in Kyushu Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2206/kyushujm.53.1

zbMATH Keywords

distance-regular graphintersection array

Mathematics Subject Classification ID

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

Recommendations

• The nonexistence of a distance-regular graph with intersection array \(\{22,16,5;1,2,20\}\)
• A distance regular graph with intersection array \((21,16,8;1,4,14)\) does not exist
• The nonexistence of a distance-regular graph with intersection array \(\{75,64,22,1;1,2,64,75\}\)
• scientific article; zbMATH DE number 6808067
• There does not exist a distance-regular graph with intersection array \(\{80, 54,12; 1, 6, 60\}\)

Cited in

(22)

• The nonexistence of a distance-regular graph with intersection array \(\{22,16,5;1,2,20\}\)
• The nonexistence of a distance-regular graph with intersection array \(\{75,64,22,1;1,2,64,75\}\)
• On distance-regular graphs with \(c_2 = 2\)
• A new condition for distance-regular graphs
• scientific article; zbMATH DE number 5128952 (Why is no real title available?)
• Distance-regular graph with intersection array \(\{143,108,27;1,12,117\}\) does not exist
• Distance-regular graphs with intersection arrays \(\{52, 35, 16; 1, 4, 28\}\) and \(\{69, 48, 24; 1, 4, 46\}\) do not exist
• Distance-regular graph with intersection array \(\{27, 20, 7; 1, 4, 21\}\) does not exist
• A distance regular graph with intersection array \((21,16,8;1,4,14)\) does not exist
• Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs
• A distance-regular graph with strongly closed subgraphs
• Nonexistence of some antipodal distance-regular graphs of diameter four
• Almost 2-homogeneous graphs and completely regular quadrangles
• The uniqueness of a distance-regular graph with intersection array \(\{32,27,8,1;1,4,27,32\}\) and related results
• On the geometricity of distance-regular graphs without 4-claws
• Distance-regular graph with the intersection array \(\{45, 30, 7; 1, 2, 27\}\) does not exist
• 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
• Nonexistence of a class of distance-regular graphs
• On the (non-)existence of tight distance-regular graphs: a local approach
• Distance-regular graphs of diameter 3 without triangles with \(c_2=2\)
• Using symbolic computation to prove nonexistence of distance-regular graphs

This page was built for publication: ON THE NON-EXISTENCE OF CERTAIN DISTANCE-REULAR GRAPHS

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