Extremal 1-codes in distance-regular graphs of diameter 3
From MaRDI portal
Publication:438900
DOI10.1007/s10623-012-9651-0zbMath1245.05036OpenAlexW2082746365MaRDI QIDQ438900
Janoš Vidali, Aleksandar Jurišić
Publication date: 31 July 2012
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-012-9651-0
nonexistencedistance-regular graphsalgebraic combinatorics1-codesKrein conditiontriple intersection numbers
Related Items
Distance-Regular Graph with Iintersection Array {140,108,18;1,18,105} Does 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 intersection array \(\{105,72,24;1,12,70\}\) does not exist, SHILLA GRAPHS WITH \(b=5\) AND \(b=6\), Unnamed Item, Distance-regular Shilla graphs with \(b_2 = c_2\), Inverse problems of graph theory: generalized quadrangles, Inverse problems in the theory of distance-regular graphs, Restrictions on classical distance-regular graphs, Implications of vanishing Krein parameters on Delsarte designs, with applications in finite geometry, 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, On few-class Q-polynomial association schemes: feasible parameters and nonexistence results, Antipodal Krein graphs and distance-regular graphs close to them, Using symbolic computation to prove nonexistence of distance-regular graphs, On automorphisms of a distance-regular graph with intersection array \(\{39,36,22;1,2,18\}\), On some recent progress in the classification of (\(P\) and \(Q\))-polynomial association schemes, Codes in Shilla distance-regular graphs, To the theory of Shilla graphs with \(b_2=c_2\), On distance-regular graph \(\Gamma\) with strongly regular graphs \(\Gamma_2\) and \(\Gamma_3\), A Shilla graph with intersection array \(\{12, 10, 2; 1, 2, 8\}\) does not exist, Automorphisms of a Distance Regular Graph with Intersection Array {48,35,9;1,7,40}, The Sylvester graph and Moore graphs, DISTANCE-REGULAR GRAPH WITH INTERSECTION ARRAY {27, 20, 7; 1, 4, 21} DOES NOT EXIST, On automorphisms of a distance-regular graph with intersection array \(\{44,30,5;1,3,40\}\), On \(Q\)-polynomial distance-regular graphs \(\Gamma\) with strongly regular graphs \(\Gamma_2\) and \(\Gamma_3\), Distance-regular graphs admitting a perfect 1-code
Cites Work
