On distance-regular graphs with fixed valency. III

DOI10.1016/0021-8693(87)90071-8MaRDI QIDQ1123214zbMATH OpenOpenAlexFDO

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

Review text

This paper is a sequel to parts I and II in Graphs Comb. 3, 95-109 (1987; Zbl 0626.05050), and ibid. 4, No.3, 219-228 (1988), respectively, but will be read mostly independent of them as long as the logical dependencies are concerned. The ultimate purpose of this series of papers is to obtain the following two assertions: (i) to bound the diameter d of any distance-regular graph by a certain function of valency k (k\(\geq 3)\), (ii) to complete the classification of distance-regular graphs with small k. (It is expected that (ii) follows generally from (i).) In this paper we answer assertion (i) completely for the bipartite case. (The graph \(\Gamma\) is said to be bipartite if the vertex set X is divided into two non-empty subsets \(X_ 1\) and \(X_ 2\) with no edges inside \(X_ i\) \((i=1,2)\). In the distance-regular case, \(\Gamma\) is bipartite if and only if \(a_ i=0\) for all i.) The general case (i.e., the nonbipartite case) will be treated in the subsequent papers of this sequel.

Recommendations

• On distance-regular graphs with fixed valency. II
• On distance-regular graphs with fixed valency
• Bounding the diameter of a distance regular graph by a function of \(k_ d\). II
• A valency bound for distance-regular graphs
• On distance-regular graphs with \(k_ i= k_ j\). II

Cites work

• A new 5‐arc‐transitive cubic graph
• Bipartite distance-regular graphs of valency three
• scientific article; zbMATH DE number 3884178 (Why is no real title available?)
• scientific article; zbMATH DE number 3878961 (Why is no real title available?)
• On distance-regular graphs with fixed valency
• On distance-regular graphs with fixed valency. II
• On Distance-Transitive Graphs
• On the Sims Conjecture and Distance Transitive Graphs
• The diameter of bipartite distance-regular graphs

Cited in

(14)

• 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
• Weakly distance-regular digraphs of valency three, II
• A valency bound 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
• 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
• 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 the Calculation of Multiplicities forP-PolynomialC-Algebras
• On distance-regular graphs with fixed valency. II

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

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