The distance-regular graphs of valency four

From MaRDI portal
Revision as of 11:53, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1296385


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)

Full work available at URL: https://doi.org/10.1023/a:1018693118268


05E30: Association schemes, strongly regular graphs


Related Items

Свойства графов орбиталов надгрупп группы Джевонса, Distance-regular Cayley graphs with small valency, Classifying the globally rigid edge‐transitive graphs and distance‐regular graphs in the plane, 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., 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


Uses Software


Cites Work