The distance-regular graphs of valency four

DOI10.1023/A:1018693118268zbMath0929.05093MaRDI QIDQ1296385

Jack H. Koolen, Andries E. Brouwer

Publication date: 25 January 2000

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

zbMATH Keywords

distance-regular graph; eigenvalues; intersection array; Terwilliger bound

Mathematics Subject Classification ID

05E30: Association schemes, strongly regular graphs

Related Items

Distance-regular graphs with an eigenvalue \(-k < \theta \leq 2-k\), Max-cut and extendability of matchings in distance-regular graphs, Distance-regular graphs with or at least half the valency, 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, The vertex-connectivity of a distance-regular graph, 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., 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

Uses Software

• nauty

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On distance-regular graphs with fixed valency. II
• On generalized hexagons and a near octagon whose lines have three points
• Distance-biregular graphs with 2-valent vertices and distance regular line graphs
• A remark on the intersection arrays of distance-regular graphs
• On distance-regular graphs with fixed valency. III
• On distance-regular graphs with fixed valency. IV
• Eigenvalue multiplicities of highly symmetric graphs
• On distance-biregular graphs of girth divisible by four
• An improvement of the Boshier-Nomura bound
• A remark on bipartite distance-regular graphs of even valency
• A constant bound on the number of columns \((1,k-2,1)\) in the intersection array of a distance-regular graph
• Cubic Distance-Regular Graphs