The distance-regular graphs of valency four
We report on a computer search that proves that each distance-regular graph of valency four has known parameters. Here we describe first the known examples, next how putative arrays were disposed of, and finally how the search could be limited to a manageable number of arrays. The distance-regular graphs of valency 3 have been determined by \textit{N. L. Biggs}, \textit{A. G. Boshier}, and \textit{J. Shawe-Taylor} [J. Lond. Math. Soc., II. Ser. 33, 385-394 (1986; Zbl 0576.05039)]. \textit{E. Bannai} and \textit{T. Itô} worked on the general project of bounding the diameter of a distance-regular graph as a function of its valency \(k\). They succeeded in the bipartite case [J. Algebra 107, 43-52 (1987; Zbl 0677.05060)] and in case \(k= 4\) [see Eur. J. Comb. 10, No. 2, 137-148 (1989; Zbl 0677.05061)]. This means that finding the feasible arrays for distance-regular graphs of valency 4 was reduced to a finite amount of work, but the diameter bounds obtained were not small enough to straightforwardly settle this case. In this note we obtain some additional conditions, and thus reduce the parameter space to be searched, and describe a way to test a parameter set using (small) integer arithmetic, thus avoiding accuracy problems.
- A constant bound on the number of columns (1,k-2,1) in the intersection array of a distance-regular graph
- A remark on bipartite distance-regular graphs of even valency
- A remark on the intersection arrays of distance-regular graphs
- An improvement of the Boshier-Nomura bound
- Cubic Distance-Regular Graphs
- Distance-biregular graphs with 2-valent vertices and distance regular line graphs
- Eigenvalue multiplicities of highly symmetric graphs
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 3981222 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- On distance-biregular graphs of girth divisible by four
- On distance-regular graphs with fixed valency. II
- On distance-regular graphs with fixed valency. III
- On distance-regular graphs with fixed valency. IV
- On generalized hexagons and a near octagon whose lines have three points
- The vertex-connectivity of a distance-regular graph
- Distance-regular digraphs of girth 4
- On distance-biregular graphs of girth divisible by four
- 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 distance-regular graph with bipartite geodetically closed subgraphs.
- Non-bipartite distance-regular graphs with a small smallest eigenvalue
- Non-bipartite distance-regular graphs with diameters 5, 6 and a smallest eigenvalue
- Eigenvalues of Cayley graphs
- On bounding the diameter of a distance-regular graph
- On minimal distance-regular Cayley graphs of generalized dihedral groups
- On the Cheeger constant for distance-regular graphs
- An inequality involving the second largest and smallest eigenvalue of a distance-regular graph
- Geometric aspects of 2-walk-regular graphs
- Improving diameter bounds for distance-regular graphs
- Classification of partially metric Q-polynomial association schemes with \(m_1=4\)
- Spectral determinations and eccentricity matrix of graphs
- scientific article; zbMATH DE number 3981222 (Why is no real title available?)
- scientific article; zbMATH DE number 4043894 (Why is no real title available?)
- Distance-regular graphs with an eigenvalue \(-k < \theta \leq 2-k\)
- scientific article; zbMATH DE number 1382595 (Why is no real title available?)
- Properties of graphs of orbitals for overgroups of the Jevons group
- Max-cut and extendability of matchings in distance-regular graphs
- Distance-regular Cayley graphs with small valency
- Classifying the globally rigid edge‐transitive graphs and distance‐regular graphs in the plane
- The Gallai and anti-Gallai graphs of strongly regular graphs
- Distance-regular graphs with or at least half the valency
- Non-geometric distance-regular graphs of diameter at least 3 with smallest eigenvalue at least -3
- The distance-regular graphs with valency \(k \geq 2\), diameter \(D \geq 3\) and \(k_{D - 1} + k_D \leq 2 k\)
- On triangle-free distance-regular graphs with an eigenvalue multiplicity equal to the valency
- A characterization of the Hamming graph by strongly closed subgraphs
This page was built for publication: The distance-regular graphs of valency four
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296385)
