On distance-regular graphs with fixed valency. III

DOI10.1016/0021-8693(87)90071-8zbMath0677.05060OpenAlexW2082629009MaRDI QIDQ1123214

Eiichi Bannai, Tatsuro Ito

Publication date: 1987

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-8693(87)90071-8

zbMATH Keywords

distance-regular graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (11)

Two theorems concerning the Bannai-Ito conjecture ⋮ On distance-regular graphs with \(k_ i= k_ j\). II ⋮ A bound for the number of columns \(\ell_{(c,a,b)}\) in the intersection array of a distance-regular graph ⋮ There are only finitely many distance-regular graphs of fixed valency greater than two ⋮ Bounding the diameter of a distance regular graph by a function of \(k_ d\) ⋮ On the Calculation of Multiplicities forP-PolynomialC-Algebras ⋮ There are only finitely many regular near polygons and geodetic distance-regular graphs with fixed valency ⋮ Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I ⋮ There are finitely many triangle-free distance-regular graphs with degree 8, 9 or 10 ⋮ The distance-regular graphs of valency four ⋮ On a conjecture of Bannai and Ito: There are finitely many distance-regular graphs with degree 5, 6 or 7

Cites Work

• Unnamed Item
• Unnamed Item
• On distance-regular graphs with fixed valency
• On distance-regular graphs with fixed valency. II
• The diameter of bipartite distance-regular graphs
• Bipartite distance-regular graphs of valency three
• On the Sims Conjecture and Distance Transitive Graphs
• On Distance-Transitive Graphs
• A new 5‐arc‐transitive cubic graph

This page was built for publication: On distance-regular graphs with fixed valency. III