Improving diameter bounds for distance-regular graphs
From MaRDI portal
Publication:2581461
DOI10.1016/j.ejc.2004.07.004zbMath1078.05089MaRDI QIDQ2581461
Jack H. Koolen, Sejeong Bang, Akira Hiraki
Publication date: 10 January 2006
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2004.07.004
05E30: Association schemes, strongly regular graphs
Related Items
Distance-regular graphs with or at least half the valency, On bounding the diameter of a distance-regular graph, Two theorems concerning the Bannai-Ito conjecture, A unified view of inequalities for distance-regular graphs. I
Cites Work
- Unnamed Item
- On subgraphs in distance-regular graphs
- The distance-regular graphs of valency four
- An improvement of the Ivanov bound
- A distance-regular graph with strongly closed subgraphs
- A bound for the diameter of distance-regular graphs
- Cubic Distance-Regular Graphs
- ON DISTANCE-REGULAR GRAPHS WITH c4=1 AND a1≠a2