On distance-regular graphs with fixed valency. II

DOI10.1007/BF01864162zbMath0699.05038OpenAlexW4238173299MaRDI QIDQ912864

Tatsuro Ito, Eiichi Bannai

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1007/bf01864162

zbMATH Keywords

distance-regular graphintersection array

Mathematics Subject Classification ID

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

Related Items (14)

Distance-regular graphs with \(\Gamma(x) \simeq 3* K_{a+1}\) ⋮ Two theorems concerning the Bannai-Ito conjecture ⋮ On distance-regular graphs with fixed valency. III ⋮ 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 ⋮ The regular near polygons of order \((s,2)\) ⋮ On symmetric association schemes with \(k_1=3\) ⋮ 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 ⋮ Distance-regular graphs of valency 6 and \(a_1=1\) ⋮ 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
• Unnamed Item
• On distance-regular graphs with fixed valency
• Distance-transitive graphs and generalized polygons
• The nonexistence of 8-transitive graphs
• Bipartite distance-regular graphs of valency three
• On the Sims Conjecture and Distance Transitive Graphs
• On Distance-Transitive Graphs

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