Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs
From MaRDI portal
Publication:941322
DOI10.1016/j.jcta.2007.12.001zbMath1182.05132OpenAlexW2049971834MaRDI QIDQ941322
Kris Coolsaet, Aleksandar Jurišić
Publication date: 4 September 2008
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2007.12.001
distance-regular graphassociation schemestrongly regular graphtriple intersection numbersKrein parameters
Related Items (31)
Triple intersection numbers for the Paley graphs ⋮ On Q-Polynomial Shilla Graphs with b=6 ⋮ Reconstructing a generalized quadrangle with a hemisystem from a 4-class association scheme ⋮ SHILLA GRAPHS WITH \(b=5\) AND \(b=6\) ⋮ Distance-regular graphs with diameter 3 and eigenvalue \(a_2 - c_3\) ⋮ A unified view of inequalities for distance-regular graphs. I ⋮ Inverse problems in the theory of distance-regular graphs ⋮ On nonexistence of distance regular graphs with the intersection array ${53,40,28,16;1,4,10,28}$ ⋮ Restrictions on classical distance-regular graphs ⋮ On distance-regular graphs \(\Gamma\) of diameter 3 for which \(\Gamma_3\) is a triangle-free graph ⋮ On small distance-regular graphs with the intersection arrays \( \{mn - 1, (m - 1)(n + 1), n - m + 1; 1, 1, (m - 1)(n + 1)\}\) ⋮ On \(Q \)-polynomial Shilla graphs with \(b=6 \) ⋮ Triple intersection numbers of \(Q\)-polynomial distance-regular graphs ⋮ Implications of vanishing Krein parameters on Delsarte designs, with applications in finite geometry ⋮ Extremal 1-codes in distance-regular graphs of diameter 3 ⋮ On tight 4-designs in Hamming association schemes ⋮ The Terwilliger polynomial of a \(Q\)-polynomial distance-regular graph and its application to pseudo-partition graphs ⋮ Reconstructing a generalized quadrangle from the Penttila-Williford 4-class association scheme ⋮ On few-class Q-polynomial association schemes: feasible parameters and nonexistence results ⋮ Three infinite families of Shilla graphs do not exist ⋮ Using symbolic computation to prove nonexistence of distance-regular graphs ⋮ Scaffolds: a graph-theoretic tool for tensor computations related to Bose-Mesner algebras ⋮ On some recent progress in the classification of (\(P\) and \(Q\))-polynomial association schemes ⋮ Distance-regular graphs with light tails ⋮ Computing distance-regular graph and association scheme parameters in \texttt{SageMath} with \texttt{sage}-\texttt{drg} ⋮ Distance-regular Terwilliger graphs with intersection arrays \(\{50,42,1;1,2,50\}\) and \(\{50,42,9;1,2,42\}\) do not exist ⋮ The mathematics of Donald Gordon Higman ⋮ 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 ⋮ On \(Q\)-polynomial distance-regular graphs \(\Gamma\) with strongly regular graphs \(\Gamma_2\) and \(\Gamma_3\) ⋮ Distance-regular graphs of diameter 3 without triangles with \(c_2=2\) ⋮ A combinatorial characterization of extremal generalized hexagons
Cites Work
This page was built for publication: Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs
