On distance-regular graphs with \(k_ i= k_ j\). II

DOI10.1007/BF01787811zbMath0835.05086MaRDI QIDQ1906855

Masayuki Wajima, Hiroshi Suzuki, Akira Hiraki

Publication date: 24 January 1996

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

distance-regular graphdiameterTerwilliger's inequality

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Cites Work

• On distance-regular graphs with fixed valency
• Distance-regular graphs with girth 3 or 4: I
• A remark on the intersection arrays of distance-regular graphs
• On distance-regular graphs with fixed valency. III
• On distance-regular graphs with fixed valency. IV
• On distance-regular graphs with \(k_ i=k_ j\)
• Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I
• Distance-regular graphs and (s,c,a,k)-graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item