A New Feasibility Condition for the AT4 Family
Combinatorics
2024-05-13 v3
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 does not exist for . We discuss the graphs with .
Keywords
Cite
@article{arxiv.2204.07842,
title = {A New Feasibility Condition for the AT4 Family},
author = {Zheng-Jiang Xia and Jae-Ho Lee and Jack H. Koolen},
journal= {arXiv preprint arXiv:2204.07842},
year = {2024}
}
Comments
15 pages, 1 table