Pseudo 1-homogeneous distance-regular graphs

Let Γ be a distance-regular graph of diameter d≥2 and a ₁≠0. Let θ be a real number. A pseudo cosine sequence for θ is a sequence of real numbers σ ₀,…,σ _d such that σ ₀=1 and c _i σ _i−1+a _i σ _i +b _i σ _i+1=θ σ _i for all i∈{0,…,d−1}. Furthermore, a pseudo primitive idempotent for θ is E _θ =s ∑ _i=0 ^d σ _i A _i , where s is any nonzero scalar. Let be the characteristic vector of a vertex v∈VΓ. For an edge xy of Γ and the characteristic vector w of the set of common neighbours of x and y, we say that the edge xy is tight with respect to θ whenever θ≠k and a nontrivial linear combination of vectors , and Ew is contained in . When an edge of Γ is tight with respect to two distinct real numbers, a parameterization with d+1 parameters of the members of the intersection array of Γ is given (using the pseudo cosines σ ₁,…,σ _d , and an auxiliary parameter ε). Let S be the set of all the vertices of Γ that are not at distance d from both vertices x and y that are adjacent. The graph Γ is pseudo 1-homogeneous with respect to xy whenever the distance partition of S corresponding to the distances from x and y is equitable in the subgraph induced on S. We show Γ is pseudo 1-homogeneous with respect to the edge xy if and only if the edge xy is tight with respect to two distinct real numbers. Finally, let us fix a vertex x of Γ. Then the graph Γ is pseudo 1-homogeneous with respect to any edge xy, and the local graph of x is connected if and only if there is the above parameterization with d+1 parameters σ ₁,…,σ _d ,ε and the local graph of x is strongly regular with nontrivial eigenvalues a ₁ σ/(1+σ) and (σ ₂−1)/(σ−σ ₂).