Abstract
Juriśič et al. (Eur J Comb 31:1539–1552, 2010) conjectured (see also [van Dam et al. in Distance-regular graphs, Problem 13]) that if a distance-regular graph \(\Gamma \) with diameter D at least three has a light tail, then one of the following holds: (1) \(a_1 =0\); (2) \(\Gamma \) is an antipodal cover of diameter three; (3) \(\Gamma \) is tight; (4) \(\Gamma \) is the halved \((2D+1)\)-cube; and (5) \(\Gamma \) is a Hermitian dual polar graph \(^2A_{2D-1}(r)\) where r is a prime power. In this note, we will consider the case when the light tail corresponds to the eigenvalue \(-\frac{k}{a_1 +1}\). Our first main result is:
Theorem Let \(\Gamma \) be a non-bipartite distance-regular graph with valency \(k \ge 3\), diameter \(D \ge 3\) and distinct eigenvalues \(\theta _0 > \theta _1 > \cdots > \theta _D\). Suppose that \(\Gamma \) is 2-bounded with smallest eigenvalue \(\theta _D = -\frac{k}{a_1 +1}\). If the minimal idempotent \(E_D\) corresponding to eigenvalue \(\theta _D\) is a light tail, then \(\Gamma \) is the dual polar graph \(^2A_{2D-1}(r)\), where \(r=a_1+1\) is a prime power.
As a consequence of this result we will show our second main result:
Theorem Let \(\Gamma \) be a distance-regular graph with valency \(k \ge 3\), diameter \(D \ge 2\), \(a_1 =1\) and \(\theta _0 > \theta _1 > \cdots > \theta _D\). If \(c_2 \ge 4\) and \(\theta _D = -k/2\), then \(c_2 =5\) and \(\Gamma \) is the dual polar graph \(^2A_{2D-1}(2)\).
Similar content being viewed by others
References
Bang S., Koolen J.H., Park J.: Some results on the eigenvalues of distance-regular graphs. Graphs Comb. 31, 1841–1853 (2015).
Brouwer A.E., Cohen A.M., Neumaier A.: Distance-Regular Graphs. Springer, Berlin (1989).
Delsarte P.: An algebraic approach to the association schemes of coding theory. Number 10 in Philips Research Reports Supplements Philips (1973).
Godsil C.D.: Algebraic Combinatorics. Chapman & Hall, New York (1993).
Godsil C.D., Royle G.: Algebraic Graph Theory. GTM 207. Springer, New York (2001).
Hiraki A.: Strongly closed subgraphs in a regular thick near polygon. Eur. J. Comb. 20, 789–796 (1999).
Hiraki A.: A characterization of some distance-regular graphs by strongly closed subgraphs. Eur. J. Comb. 30, 893–907 (2009).
Jurišić A., Terwilliger P., Žitnik A.: Distance-regular graphs with light tails. Eur. J. Comb. 31, 1539–1552 (2010).
Koolen J.H., Qiao Z.: Distance-regular graph with valency \(k\) and smallest eigenvalue at most \(-k/2\). arXiv:1507.04839v2.
Pascasio A.A.: Tight graphs and their primitive idempotents. J. Algebraic Comb. 10, 47–59 (1999).
Payne S.E., Thas J.A.: Finite Generalized Quadrangles, 2nd edn. European Mathematical Society, Zürich (2009).
van Dam E.R., Koolen J.H., Tanaka H.: Distance-regular graphs. arXiv:1410.6294v1.
Acknowledgments
We would like to thank Jongyook Park. He carefully read an earlier version of the note and his comments improved the note significantly. JHK was partially supported by the National Natural Science Foundation of China (No. 11471009).
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to Andries Brouwer on the occasion of his 65th birthday.
This is one of several papers published in Designs, Codes and Cryptography comprising the special issue in honor of Andries Brouwer’s 65th birthday.
Rights and permissions
About this article
Cite this article
Koolen, J., Qiao, Z. Light tails and the Hermitian dual polar graphs. Des. Codes Cryptogr. 84, 3–12 (2017). https://doi.org/10.1007/s10623-016-0188-5
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-016-0188-5