Bounding the diameter of a distance regular graph by a function of \(k_ d\)

DOI10.1007/BF01787641zbMath0755.05057MaRDI QIDQ1180676

Hiroshi Suzuki

Publication date: 27 June 1992

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

zbMATH Keywords

cliquesdistance regular graphbounding the diameter

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Related Items (5)

On strongly closed subgraphs of highly regular graphs ⋮ On bounding the diameter of a distance-regular graph ⋮ On distance-regular graphs with height two ⋮ On distance-regular graphs with height two. II ⋮ Distance-regular graphs of valency 6 and \(a_1=1\)

Cites Work

• On distance-regular graphs with fixed valency
• On distance-regular graphs with fixed valency. II
• A local characterization of the Johnson scheme
• Characterization of the association schemes of Hermitian forms over \(GF(2^ 2)\)
• On distance-regular graphs with fixed valency. III
• On distance-regular graphs with fixed valency. IV
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounding the diameter of a distance regular graph by a function of \(k_ d\)