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
From MaRDI portal
Publication:2331137
Recommendations
- Distance-regular graphs with intersection arrays \(\{52, 35, 16; 1, 4, 28\}\) and \(\{69, 48, 24; 1, 4, 46\}\) do not exist
- Distance-Regular Graphs with Intersection Arrays {7,6,6;1,1,2} and {42,30,2;1,10,36} Do 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 Iintersection Array {140,108,18;1,18,105} Does not Exist
- Distance-regular graph with intersection array \(\{105,72,24;1,12,70\}\) does not exist
- scientific article; zbMATH DE number 6808067
- 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 graph with the intersection array \(\{45, 30, 7; 1, 2, 27\}\) does not exist
- The nonexistence of a distance-regular graph with intersection array \(\{75,64,22,1;1,2,64,75\}\)
Cites work
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- On automorphisms of a distance-regular graph with intersection array $\{69, 56, 10; 1, 14, 60\}$
- On automorphisms of a distance-regular graph with intersection array \(\{119,100,15;1,20,105\}\)
- On distance-regular graph \(\Gamma\) with strongly regular graphs \(\Gamma_2\) and \(\Gamma_3\)
- The Sylvester graph and Moore graphs
- Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs
Cited in
(13)- Distance-regular graphs of diameter 3 without triangles with c₂=2
- The nonexistence small Q-polynomial graphs of type (III)
- Inverse problems of graph theory: graphs without triangles
- On distance-regular graph \(\Gamma\) with strongly regular graphs \(\Gamma_2\) and \(\Gamma_3\)
- On Q-polynomial distance-regular graphs with strongly regular graphs _2 and _3
- Distance-regular graphs with intersection arrays \(\{42,30,12;1,6,28\}\) and \(\{60,45,8;1,12,50\}\) do not exist
- Triple intersection numbers of Q-polynomial distance-regular graphs
- scientific article; zbMATH DE number 6808067 (Why is no real title available?)
- Distance-regular graph with intersection array \(\{27, 20, 7; 1, 4, 21\}\) 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 nonexistence of distance regular graphs with the intersection array ${53,40,28,16;1,4,10,28}$
- On distance-regular graphs \(\Gamma\) of diameter 3 for which \(\Gamma_3\) is a triangle-free graph
- Distance-regular graph with intersection array \(\{143,108,27;1,12,117\}\) does not exist
This page was built for publication: 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2331137)