Distance-regular graphs with intersection arrays \42,30,12;1,6,28\ and \60,45,8;1,12,50\ do not exist
From MaRDI portal
Publication:2633389
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 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\}\)
- scientific article; zbMATH DE number 6808067
- Distance-regular graph with intersection array \(\{105,72,24;1,12,70\}\) does not exist
- On nonexistence of distance regular graphs with the intersection array ${53,40,28,16;1,4,10,28}$
- Distance-regular graph with the intersection array \(\{45, 30, 7; 1, 2, 27\}\) does not exist
- Distance-Regular Graph with Iintersection Array {140,108,18;1,18,105} Does not Exist
- The nonexistence of a distance-regular graph with intersection array \(\{75,64,22,1;1,2,64,75\}\)
Cites work
- Automorphisms of graphs with intersection arrays \(\{60, 45, 8; 1, 12, 50\}\) and \(\{49, 36, 8; 1, 6, 42\}\)
- Extremal 1-codes in distance-regular graphs of diameter 3
- scientific article; zbMATH DE number 6808067 (Why is no real title available?)
- On automorphisms of distance-regular graph with intersection array \(\{15, 12, 6; 1, 2, 10\}\)
- Shilla distance-regular graphs
Cited in
(14)- Distance-regular Terwilliger graphs with intersection arrays \(\{50,42,1;1,2,50\}\) and \(\{50,42,9;1,2,42\}\) do not exist
- Automorphisms of a distance-regular graph with intersection array \(\{30,22,9;1,3,20\}\)
- 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
- Automorphisms of distance-regular graph with intersection array \(\{24,18,9;1,1,16\}\)
- Distance-regular graph with intersection array \(\{105,72,24;1,12,70\}\) does not exist
- The Koolen-Park boundary and distance-regular graphs without \(m\)-claws
- Distance-regular graphs with intersection arrays \(\{52, 35, 16; 1, 4, 28\}\) and \(\{69, 48, 24; 1, 4, 46\}\) do not exist
- scientific article; zbMATH DE number 6808067 (Why is no real title available?)
- Distance-Regular Graph with Iintersection Array {140,108,18;1,18,105} 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
- \(Q\)-polynomial Shilla graphs with intersection arrays \(\{42,30,12;1,6,28\}\) and \(\{105,72,24;1,12,70\}\) do not exist
- A distance-regular graph with intersection array (5,4,3,3; 1,1,1,2) does not exist
This page was built for publication: Distance-regular graphs with intersection arrays \(\{42,30,12;1,6,28\}\) and \(\{60,45,8;1,12,50\}\) do not exist
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2633389)