Distance-regular graphs with or at least half the valency

DOI10.1016/j.jcta.2011.11.001zbMath1235.05043arXiv1008.1209MaRDI QIDQ662028

Jack H. Koolen, Jongyook Park

Publication date: 11 February 2012

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1008.1209

zbMATH Keywords

Taylor graphs; distance-regular graphs; line graphs

Mathematics Subject Classification ID

05C12: Distance in graphs

Related Items

Unnamed Item, Unnamed Item, Unnamed Item, On extensions of exceptional strongly regular graphs with eigenvalue 3, On extensions of exceptional strongly regular graphs with eigenvalue 3, A relationship between the diameter and the intersection number \(c _{2}\) for a distance-regular graph, On graphs whose local subgraphs are pseudogeometric for \(GQ(4, t)\), Max-cut and extendability of matchings in distance-regular graphs, The distance-regular graphs with valency \(k \geq 2\), diameter \(D \geq 3\) and \(k_{D - 1} + k_D \leq 2 k\), On extensions of small strongly regular graphs with eigenvalue 3, A collection of results concerning electric resistance and simple random walk on distance-regular graphs, Distance-regular Shilla graphs with \(b_2 = c_2\), Two characterizations of the grid graphs, A characterization of Johnson and Hamming graphs and proof of Babai's conjecture, Thin \(Q\)-polynomial distance-regular graphs have bounded \(c_2\), On bounding the diameter of a distance-regular graph, Distance-regular graphs with diameter 3 and eigenvalue \(a_2 - c_3\), Distance-regular graphs without 4-claws, Twice \(Q\)-polynomial distance-regular graphs of diameter 4

Cites Work

• Unnamed Item
• Unnamed Item
• Delsarte set graphs with small \(c_{2}\)
• Shilla distance-regular graphs
• Distance regular graphs of diameter 3 and strongly regular graphs
• The vertex-connectivity of a distance-regular graph
• Distance-biregular graphs with 2-valent vertices and distance regular line graphs
• The distance-regular graphs of valency four
• Determination of the distance-regular graphs without 3-claws
• Interlacing eigenvalues and graphs
• An inequality involving the second largest and smallest eigenvalue of a distance-regular graph
• On the spectrum of an extremal graph with four eigenvalues
• Improving diameter bounds for distance-regular graphs
• Cubic Distance-Regular Graphs