Two distance-regular graphs

DOI10.1007/s10801-011-0341-1zbMath1254.05199arXiv1107.0475OpenAlexW3104216347WikidataQ56859912 ScholiaQ56859912MaRDI QIDQ1759331

Andries E. Brouwer, Dimitrii V. Pasechnik

Publication date: 20 November 2012

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

Full work available at URL: https://arxiv.org/abs/1107.0475

zbMATH Keywords

distance-regular graphdual polar graphintersection arrayBuckenhout-Tits diagramextended bipartite double

Mathematics Subject Classification ID

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

Related Items

Bounds for incidence energy of some graphs, On few-class Q-polynomial association schemes: feasible parameters and nonexistence results, On small world non-Sunada twins and cellular Voronoi diagrams

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item