A constant bound on the number of columns \((1,k-2,1)\) in the intersection array of a distance-regular graph

DOI10.1007/BF01858442zbMath0847.05101MaRDI QIDQ1911238

Akira Hiraki

Publication date: 23 September 1996

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

zbMATH Keywords

distance-regular graphintersection arrayintersection diagrams

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (3)

Distance-regular subgraphs in a distance-regular graph. I ⋮ A bound for the number of columns \(\ell_{(c,a,b)}\) in the intersection array of a distance-regular graph ⋮ The distance-regular graphs of valency four

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On distance-regular graphs with fixed valency
• A remark on the intersection arrays of distance-regular graphs
• Eigenvalue multiplicities of highly symmetric graphs
• An improvement of the Boshier-Nomura bound
• Cubic Distance-Regular Graphs

This page was built for publication: A constant bound on the number of columns \((1,k-2,1)\) in the intersection array of a distance-regular graph