Extremal 1-codes in distance-regular graphs of diameter 3

DOI10.1007/S10623-012-9651-0MaRDI QIDQ438900zbMATH OpenOpenAlexFDO

Authors Aleksandar Jurišić, Janoš Vidali

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

zbMATH Keywords

nonexistencedistance-regular graphsalgebraic combinatorics1-codesKrein conditiontriple intersection numbers

Mathematics Subject Classification ID

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

Recommendations

• Distance-regular graphs admitting a perfect 1-code
• Classification of a class of distance-regular graphs via completely regular codes
• Perfect binary \((n,3)\) codes: The structure of graphs of minimum distances
• An algebraic characterization of completely regular codes in distance-regular graphs
• scientific article; zbMATH DE number 1285452
• Codes in Shilla distance-regular graphs
• scientific article; zbMATH DE number 4104861
• Distance regular graphs of diameter 3 and strongly regular graphs
• scientific article; zbMATH DE number 4045789
• A characterization of distance-regular graphs with diameter three

Cites work

• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• A characterization of \(P\)- and \(Q\)-polynomial association schemes
• Shilla distance-regular graphs
• Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs

Cited in

(30)

• The Terwilliger polynomial of a \(Q\)-polynomial distance-regular graph and its application to pseudo-partition graphs
• Codes in Shilla distance-regular graphs
• On few-class \(Q\)-polynomial association schemes: feasible parameters and nonexistence results
• Antipodal Krein graphs and distance-regular graphs close to them
• On automorphisms of a distance-regular graph with intersection of arrays \(\{39,30,4; 1,5,36\}\)
• On tight 4-designs in Hamming association schemes
• 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
• Restrictions on classical distance-regular graphs
• On automorphisms of a distance-regular graph with intersection array \(\{44,30,5;1,3,40\}\)
• Using symbolic computation to prove nonexistence of distance-regular graphs
• Distance-regular Shilla graphs with \(b_2 = c_2\)
• Automorphisms of a distance regular graph with intersection array \(\{48,35,9;1,7,40\}\)
• On \(Q\)-polynomial distance-regular graphs \(\Gamma\) with strongly regular graphs \(\Gamma_2\) and \(\Gamma_3\)
• SHILLA GRAPHS WITH \(b=5\) AND \(b=6\)
• Inverse problems in the theory of distance-regular graphs
• Distance-regular graphs admitting a perfect 1-code
• 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
• A new distance-regular graph of diameter 3 on 1024 vertices
• Distance-regular graph with intersection array \(\{27, 20, 7; 1, 4, 21\}\) does not exist
• 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
• To the theory of Shilla graphs with \(b_2=c_2\)
• Inverse problems of graph theory: generalized quadrangles
• The Sylvester graph and Moore graphs
• Implications of vanishing Krein parameters on Delsarte designs, with applications in finite geometry
• A characterization of the Grassmann graphs
• Distance-regular graph with intersection array \(\{143,108,27;1,12,117\}\) does not exist

This page was built for publication: Extremal 1-codes in distance-regular graphs of diameter 3

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