On distance-regular graphs with fixed valency

DOI10.1007/BF01788534MaRDI QIDQ580374zbMATH OpenWikidataFDO

Authors Eiichi Bannai, Tatsuro Ito

Publication date 1987

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

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

zbMATH Keywords

diameterdistance-regular graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph theory (05C99)

Review text

Let \(\Gamma\) be a finite distance-regular graph which is not an n-gon, with intersection numbers \(c_ i\), \(a_ i\), \(b_ i\). Then the numer of triples \((c_ i,a_ i,b_ i)\) such that \(c_ i=b_ i\) is bounded by a function of the valency of k. This paper is the first step of a programme to show that the diameter of a distance-regular graph is bounded. The projected steps will deal next with the case \((c_ i,a_ i,b_ i)\neq (1,0,k-1)\), (k-1,0,1) and then \((c_ i,a_ i,b_ i)=(1,0,k-1)\), (k-1,0,1).

Recommendations

• On distance-regular graphs with fixed valency. II
• On distance-regular graphs with fixed valency. IV
• Bounding the diameter of a distance regular graph by a function of \(k_ d\). II
• On distance-regular graphs with \(k_ i= k_ j\). 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\)

Cites work

• Bipartite distance-regular graphs of valency three
• Eigenvalue multiplicities of highly symmetric 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 3758369 (Why is no real title available?)
• scientific article; zbMATH DE number 3605240 (Why is no real title available?)
• On bipartite tetra0alent graphs
• On the Sims Conjecture and Distance Transitive Graphs
• On Trivalent Graphs

Cited in

(24)

• 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\)
• The distance-regular graphs of valency four
• A bound for the number of columns \(\ell_{(c,a,b)}\) in the intersection array of a distance-regular graph
• Distance-regular graphs of valency 6 and a₁=1
• Applications of the retracing method for distance-regular graphs
• 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
• 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
• A remark on bipartite distance-regular graphs of even valency
• 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-geodesic transitive graphs of valency six
• A note on distance-regular graphs with a small number of vertices compared to the valency
• Two theorems concerning the Bannai-Ito conjecture
• There are only finitely many regular near polygons and geodetic distance-regular graphs with fixed valency
• There are only finitely many distance-regular graphs of fixed valency greater than two
• On geodesic transitive graphs
• Distance-regular Cayley graphs with small valency
• Distance-regular graphs with or at least half the valency
• An overview on vertex stabilizers in vertex-transitive graphs
• On distance-regular graphs with fixed valency. II

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

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