A New Feasibility Condition for the AT4 Family
Zheng-Jiang Xia, Jae-Ho Lee, Jack H. Koolen

TL;DR
This paper introduces a new feasibility condition for a specific family of antipodal distance-regular graphs with diameter four, providing criteria for their structure and non-existence results for certain parameter sets.
Contribution
It establishes a necessary and sufficient condition for the second subconstituent of AT4(p,q,2) graphs to be antipodal tight, and proves the non-existence of AT4(q^3-2q,q,2) graphs for certain q.
Findings
Derived a new feasibility condition for AT4(p,q,r) graphs.
Proved non-existence of AT4(q^3-2q,q,2) for q ≡ 3 mod 4.
Analyzed the structure of AT4 graphs with specific parameter relations.
Abstract
Let be an antipodal distance-regular graph with diameter and eigenvalues . Then is tight in the sense of Juri\v{s}i\'{c}, Koolen, and Terwilliger [12] whenever is locally strongly regular with nontrivial eigenvalues and . Assume that is tight. Then the intersection numbers of are expressed in terms of , , and , where is the size of the antipodal classes of . We denote by and call this an antipodal tight graph of diameter with parameters . In this paper, we give a new feasibility condition for the family. We determine a necessary and sufficient condition for the second subconstituent of to be an antipodal tight graph. Using this condition, we prove that there…
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
