On distance-regular graphs with height two

DOI10.1023/A:1022440414422zbMath0843.05104MaRDI QIDQ1906253

Masato Tomiyama

Publication date: 13 August 1996

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

zbMATH Keywords

heightdistance-regular graphstrongly regular graphdistancediameterclique

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (1)

On distance-regular graphs with height two. II

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\)
• A remark on the intersection arrays of distance-regular graphs
• Bounding the diameter of a distance regular graph by a function of \(k_ d\)
• Second neighbourhoods of strongly regular graphs
• Bounding the diameter of a distance regular graph by a function of \(k_ d\). II
• Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I
• Characerization of a class of distance regular graphs.

This page was built for publication: On distance-regular graphs with height two