A characterization of some distance-regular graphs by strongly closed subgraphs

Abstract: In this paper we study a distance-regular graph of diameter such that for any given pair of vertices at distance there exists a strongly closed subgraph of diameter containing them. We prove several inequalities for intersection numbers of . We show that if the equalities hold in some of these inequalities, then is either the Odd graph, the doubled Odd graph, the doubled Grassmann graph, the Hamming graph or the dual polar graph. [Copyright &y& Elsevier]