Distance-regular graphs with classical parameters that support a uniform structure: case $q \ge 2$
Blas Fern\'andez, Roghayeh Maleki, \v{S}tefko Miklavi\v{c}, Giusy, Monzillo

TL;DR
This paper investigates when certain distance-regular graphs with classical parameters support a uniform structure, focusing on the case where the parameter q is at least 2, and establishes specific conditions on the parameters for this to occur.
Contribution
It characterizes the parameters under which distance-regular graphs with classical parameters support a uniform structure for q ≥ 2, extending previous work on the case q ≤ 1.
Findings
If the graph supports a uniform structure, then either α=0 or α=q.
The parameter β must satisfy β=q^2(q^D-1)/(q-1).
The diameter D must be divisible by 6.
Abstract
Let denote a finite, simple, connected, and undirected non-bipartite graph with vertex set and edge set . Fix a vertex , and define , where denotes the path-length distance in . Observe that the graph is bipartite. We say that supports a uniform structure with respect to whenever has a uniform structure with respect to in the sense of Miklavi\v{c} and Terwilliger \cite{MikTer}. Assume that is a distance-regular graph with classical parameters and diameter . Recall that is an integer such that . The purpose of this paper is to study when supports a uniform structure with respect to . We studied the case $q…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Advanced Topics in Algebra · Rings, Modules, and Algebras
