On geometric distance-regular graphs with diameter three

DOI10.1016/j.ejc.2013.06.044zbMath1284.05077MaRDI QIDQ2441641

Jack H. Koolen, Sejeong Bang

Publication date: 25 March 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2013.06.044

zbMATH Keywords

Johnson graph; Hamming graphs with diameter three

Mathematics Subject Classification ID

05C12: Distance in graphs

Related Items

О дистанционно регулярном графе с массивом пересечений {35,28,6;1,2,30}, On the spectral gap and the automorphism group of distance-regular graphs, Distance-regular graphs without 4-claws, Diameter bounds for geometric distance-regular graphs, Automorphisms of distance regular graph with intersection array \(\{30,27,24;1,2,10\}\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance-regular graphs
• There are only finitely many distance-regular graphs of fixed valency greater than two
• On distance-regular graphs with smallest eigenvalue at least \(- m\)
• Delsarte clique graphs
• Distance-biregular graphs with 2-valent vertices and distance regular line graphs
• Distance-regular graphs of valency 6 and \(a_1=1\)
• A Higman-Haemers inequality for thick regular near polygons
• Distance-regular graphs with \(\Gamma(x) \simeq 3* K_{a+1}\)
• Geometric distance-regular graphs without 4-claws
• Cubic Distance-Regular Graphs
• Distance-regular graph with the intersection array {45, 30, 7; 1, 2, 27} does not exist