Light tails and the Hermitian dual polar graphs
Jack Koolen, Zhi Qiao

TL;DR
This paper characterizes certain distance-regular graphs with light tails, showing that under specific eigenvalue conditions, such graphs are dual polar graphs of type $^2A_{2D-1}(r)$, especially when the smallest eigenvalue is $-rac{k}{a_1+1}$.
Contribution
It proves that non-bipartite distance-regular graphs with a light tail and specific eigenvalue conditions are precisely the dual polar graphs $^2A_{2D-1}(r)$, with $r$ a prime power.
Findings
Graphs with a light tail and eigenvalue $-rac{k}{a_1+1}$ are dual polar graphs $^2A_{2D-1}(r)$.
Under certain parameters, the graph is uniquely determined as a dual polar graph with $r=2$.
The paper establishes conditions for the eigenvalues and intersection numbers that characterize dual polar graphs.
Abstract
Juri\'{s}i\v{c} et al. conjectured that if a distance-regular graph with diameter at least three has a light tail, then one of the following holds: 1.; 2. is an antipodal cover of diameter three; 3. is tight; 4. is the halved -cube; 5. is a Hermitian dual polar graph where is a prime power. In this note, we will consider the case when the light tail corresponds to the eigenvalue . Our main result is: Theorem Let be a non-bipartite distance-regular graph with valency , diameter and distinct eigenvalues . Suppose that is -bounded with smallest eigenvalue . If the minimal idempotent , corresponding to eigenvalue , is a light tail, then is the…
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 · Graph theory and applications · Coding theory and cryptography
