Let Γ be a distance-regular graph of diameter d≥ 3 with c 2> 1. Let m be an integer with 1≤
m≤ d− 1. We consider the following conditions:(SC) m: For any pair of vertices at distance m …

Let Γ be a distance-regular graph of diameter d≥ 3 with c 2> 1. Let m be an integer with 1≤
m≤ d− 1. We consider the following conditions:(SC) m: For any pair of vertices at distance m …

Let Γ be a distance-regular graph of diameter d, valency k and r:= max i|(ci, bi)=(c 1, b 1). Let
q be an integer with r+ 1≤ q≤ d− 1. In this paper we prove the following results: Theorem 1 …

Let\varGamma Γ be a distance-regular graph with diameter d ≥ 2 d≥ 2. It is said to have
classical parameters (d, b, α, β)(d, b, α, β) when its intersection array {b_0, b_1,\dots, b_ d-1; …

Let Γ=(X, R) denote a distance-regular graph with diameterD≥ 3 and distance functionδ. A
(vertex) subgraph Δ⊆ Xis said to beweak-geodetically closedwhenever for allx, y∈ Δ and …

A note on triangle-free distance-regular graphs with a2≠0 Page 1 Journal of Combinatorial
Theory, Series B 99 (2009) 266–270 Contents lists available at ScienceDirect Journal of …

Distance-regular Subgraphs in a Distance-regular Graph , III Page 1 Europ . J .
Combinatorics (1996) 17 , 629 – 636 Distance-regular Subgraphs in a Distance-regular …

Let Γ denote a distance-regular graph with classical parameters (D, b, α, β) and D≥ 3.
Assume the intersection numbers a1= 0 and a2≠ 0. We show that Γ is 3-bounded in the …

In this paper we give a sufficient condition for the existence of a strongly closed subgraph
which is (cq+ aq)-regular of diameterqcontaining a given pair of vertices at distanceqin a …

Graphs and Combinatorics Distance-regular Graphs of the Height h Page 1 Graphs and
Combinatorics (1999) 15 : 417±428 Graphs and Combinatorics ( Springer-Verlag 1999 …