May 3, 2024 · We prove that if a tight distance-regular graph Γ Γ is not locally the block graph of an orthogonal array or a Steiner system, then the valency (and hence ...

Dec 9, 2023 · We prove that if a tight distance-regular graph \Gamma is not locally the block graph of an orthogonal array or a Steiner system, then the valency (and hence ...

Jan 8, 2024 · On the (non-)existence of tight distance-regular graphs: a local approach. Jack H. Koolena,b. Jae-Ho Leec. Shuang-Dong Lid. Yun-Han Lie. Xiaoye ...

On the (non-)existence of tight distance-regular graphs: a local approach. / Koolen, Jack H.; Lee, Jae Ho; Li, Shuang Dong et al. In: Electronic Journal of ...

May 6, 2024 · Assume that for every triple of vertices $x, y, z$ of $\Gamma$, where $x$ and $y$ are adjacent, and $z$ is at distance $2$ from both $x$ and $y$ ...

In the present paper, we prove this conjecture and, furthermore, extend it from the following aspect. Assume that for every triple of vertices $x, y, z$ of $\ ...

In the present paper, we prove this conjecture and, furthermore, extend it from the following aspect. Assume that for every triple of vertices x ...

Dec 9, 2023 · Comb. 2022. In this note we investigate how to use an initial portion of the intersection array of a distance-regular graph to give an upper ...

On the (Non-)Existence of Tight Distance-Regular Graphs: a Local Approach ; Journal: The Electronic Journal of Combinatorics. Publication Date: May 3, 2024.

On the (Non-)Existence of Tight Distance-Regular Graphs: a Local Approach. J. Koolen, J. Lee, S. Li, Y. Li, X. Liang, and Y. Tan. Electron. J. Comb., (2024 ).