On bounding the diameter of a distance-regular graph (Q2151185)

It is investigated how to use an initial portion of the intersection array of a distance-regular graph to give an upper bound for the diameter of the graph. In particular, three new diameter bounds are obtained. These bounds are tight for the Hamming \(d\)-cube, doubled Odd graphs, the Heawood graph, Tutte's \(8\)-cage and \(12\)-cage, the generalized dodecagons of order \((1,3)\) and \((1,4)\), the Biggs-Smith graph, the Pappus graph, the Wells graph, and dodecahedron.