On distance-regular graphs with height two. II

DOI10.1023/A:1008664622576zbMath0894.05054MaRDI QIDQ1383815

Masato Tomiyama

Publication date: 31 August 1998

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

zbMATH Keywords

distance-regular graphJohnson graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Cites Work

• The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\)
• Bounding the diameter of a distance regular graph by a function of \(k_ d\)
• An application of intersection diagrams of high rank
• Bounding the diameter of a distance regular graph by a function of \(k_ d\). II
• On bipartite tetra0alent graphs
• On distance-regular graphs with height two
• A note on association schemes with two \(\text{P}\)-polynomial structures of type III
• Characerization of a class of distance regular graphs.
• ON DISTANCE-i-GRAPHS OF DISTANCE-REGULAR GRAPHS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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