An application of intersection diagrams of high rank

DOI10.1016/0012-365X(92)00483-8zbMath0799.05069OpenAlexW1990283782MaRDI QIDQ1322233

V. Pereyra

Publication date: 14 November 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(92)00483-8

zbMATH Keywords

distance-regular graphsintersection diagrams

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items

On distance-regular graphs with height two. II

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A remark on association schemes with two P-polynomial structures
• Distance degree regular graphs
• An inequality between intersection numbers of a distance-regular graph
• A remark on the intersection arrays of distance-regular graphs
• On local structure of a distance-regular graph of Hamming type
• Homogeneous graphs and regular near polygons
• Some inequalities in distance-regular graphs
• An improvement of the Boshier-Nomura bound
• On distance-regular graphs with \(k_ i=k_ j\)
• Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I
• Distance-regular graphs of Hamming type
• Intersection diagrams of distance-biregular graphs