On distance-regular graphs with fixed valency. II

DOI10.1007/BF01864162MaRDI QIDQ912864zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• On distance-regular graphs with fixed valency. IV
• On distance-regular graphs with fixed valency
• On distance-regular graphs with fixed valency. III
• 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\)
• On geometric distance-regular graphs with diameter three

Cites work

• Bipartite distance-regular graphs of valency three
• Distance-transitive graphs and generalized polygons
• scientific article; zbMATH DE number 3878961 (Why is no real title available?)
• scientific article; zbMATH DE number 3605240 (Why is no real title available?)
• scientific article; zbMATH DE number 3445271 (Why is no real title available?)
• On distance-regular graphs with fixed valency
• On Distance-Transitive Graphs
• On the Sims Conjecture and Distance Transitive Graphs
• The nonexistence of 8-transitive graphs

Cited in

(26)

• On distance-regular graphs with fixed valency. III
• On distance-regular graphs with fixed valency. IV
• 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\)
• Truncated \(D_ n\) Coxeter complexes as extended partial geometries with maximum diameter
• On symmetric association schemes with \(k_1=3\)
• The distance-regular graphs of valency four
• Distance-regular graphs of valency 6 and a₁=1
• Weakly distance-regular digraphs of valency three, II
• A valency bound for distance-regular graphs
• The regular near polygons of order \((s,2)\)
• 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
• On a conjecture of Bannai and Ito: There are finitely many distance-regular graphs with degree 5, 6 or 7
• A remark on bipartite distance-regular graphs of even valency
• Distance-regular graphs with \(\Gamma(x) \simeq 3* K_{a+1}\)
• Two theorems concerning the Bannai-Ito conjecture
• Characerization of a class of distance regular graphs.
• There are only finitely many regular near polygons and geodetic distance-regular graphs with fixed valency
• Cubic Distance-Regular Graphs
• scientific article; zbMATH DE number 3981222 (Why is no real title available?)
• 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
• Distance-regular graphs with valency \(k\), diameter \(D \geq 3\) and at most \(Dk+1\) vertices
• The classification of distance-regular graphs of type IIB

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

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