On distance-regular graphs with fixed valency. IV

DOI10.1016/S0195-6698(89)80041-1MaRDI QIDQ1123215zbMATH OpenOpenAlexFDO

Authors Eiichi Bannai, Tatsuro Ito

Publication date 1989

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0195-6698(89)80041-1

zbMATH Keywords

Distance-regular graphs

Mathematics Subject Classification ID

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

Recommendations

• On distance-regular graphs with fixed valency. II
• A remark on the intersection arrays of distance regular graphs and the distance regular graphs of diameter \(d=3i -1\) with \(b_ i =1\) and \(k>2\)
• scientific article; zbMATH DE number 4132195
• On distance-regular graphs with fixed valency
• A constant bound on the number of columns (1,k-2,1) in the intersection array of a distance-regular graph

Cites work

• A remark on the intersection arrays of distance-regular graphs
• Cubic Distance-Regular Graphs
• scientific article; zbMATH DE number 3884178 (Why is no real title available?)
• scientific article; zbMATH DE number 3878961 (Why is no real title available?)
• scientific article; zbMATH DE number 3652272 (Why is no real title available?)
• On distance-regular graphs with fixed valency

Cited in

(22)

• Table algebras
• Bounding the diameter of a distance regular graph by a function of \(k_ d\)
• A remark on the intersection arrays of distance regular graphs and the distance regular graphs of diameter \(d=3i -1\) with \(b_ i =1\) and \(k>2\)
• The distance-regular graphs of valency four
• An improvement of the Boshier-Nomura bound
• The number of columns (1,k-2,1) in the intersection array of a distance-regular graph
• A bound for the number of columns \(\ell_{(c,a,b)}\) in the intersection array of a distance-regular graph
• Finite analogues of non-Euclidean spaces and Ramanujan graphs.
• Distance-regular graphs of valency 6 and a₁=1
• There are finitely many triangle-free distance-regular graphs with degree 8, 9 or 10
• Valency of distance-regular antipodal graphs with diameter 4
• On a conjecture of Bannai and Ito: There are finitely many distance-regular graphs with degree 5, 6 or 7
• On distance-regular graphs with \(k_ i= k_ j\). II
• A constant bound on the number of columns (1,k-2,1) in the intersection array of a distance-regular graph
• Two theorems concerning the Bannai-Ito conjecture
• scientific article; zbMATH DE number 3878961 (Why is no real title available?)
• There are only finitely many regular near polygons and geodetic distance-regular graphs with fixed valency
• ON DISTANCE-REGULAR GRAPHS WITH c4=1 AND a1≠a2
• There are only finitely many distance-regular graphs of fixed valency greater than two
• On the Calculation of Multiplicities forP-PolynomialC-Algebras
• On distance-regular graphs with fixed valency
• On distance-regular graphs with fixed valency. II

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1123215)