

%\addcontentsline{toc}{section}{References}

\begin{thebibliography}{999}

\bibitem{ADJ15}
Abdollahi, A., Van Dam, E.R., Jazaeri, M., Distance-regular Cayley
graphs with least eigenvalue $-2$, {\sl Des. Codes Cryptogr.}, to
appear;
\arxiv{1512.06019}.


\bibitem{AbiadQuasi14}
Abiad, A., Van Dam, E.R., Fiol, M.A.,
Some spectral and quasi-spectral characterizations of distance-regular graphs, preprint (2014);
\arxiv{1404.3973}.


\bibitem{Aldousbook} Aldous, D., Fill, J.A., Reversible Markov
    chains and random walks on graphs, manuscript (2001); \url{http://www.stat.berkeley.edu/~aldous/RWG/book}.


\bibitem{AlHaSmith} Alfuraidan, M.R., Hall, J.I., Smith's theorem and a
    characterization of the 6-cube as distance-transitive graph, {\sl  J.
    Algebraic Combin.} 24 (2006), 195--207.

\bibitem{AH09} Alfuraidan, M.R., Hall, J.I., Imprimitive distance-transitive
    graphs with primitive core of diameter at least 3, {\sl Michigan Math. J.} 58 (2009), 31--77.

\bibitem{AFM1999IJM}
Arad, Z., Fisman, E., Muzychuk, M.,
Generalized table algebras,
{\sl Israel J. Math.} 114 (1999), 29--60.

\bibitem{AH98} % MR1648464 (99j:05194)
Araya, M., Hiraki, A., Distance-regular graphs with $c\sb i=b\sb {d-i}$ and
antipodal double covers, {\sl J. Algebraic Combin.} 8 (1998), 127--138.

\bibitem{AHJ96} % MR1399679 (97d:05280)
Araya, M., Hiraki, A., Juri\v si\'c, A., Distance-regular graphs with $b\sb
t=1$ and antipodal double-covers, {\sl J. Combin. Theory Ser. B} 67 (1996), 278--283.

\bibitem{AHJ97} % MR1437000 (98c:05169)
Araya, M., Hiraki, A., Juri\v si\'c, A., Distance-regular graphs with $b\sb
2=1$ and antipodal covers, {\sl European J. Combin.} 18 (1997),
243--248.

\bibitem{Babaimetric} Babai, L., On the order of uniprimitive permutation
    groups, {\sl Ann. of Math.} 113 (1981), 553--568.



\bibitem{BGSV2012B} Bachoc, C., Gijswijt, D.C., Schrijver, A., Vallentin, F.,
    Invariant semidefinite programs, {\sl Handbook on Semidefinite, Conic and
    Polynomial Optimization} (M.F. Anjos, J.B. Lasserre, eds.), Springer, New York, 2012, pp.~219--269;
    \arxiv{1007.2905}.

\bibitem{BV2008JAMS}
Bachoc, C., Vallentin, F.,
New upper bounds for kissing numbers from semidefinite programming,
{\sl J. Amer. Math. Soc.} 21 (2008), 909--924;
\arxiv{math/0608426}.

\bibitem{BHW09} Bai, Y., Huang, T., Wang, K.,
    Error-correcting pooling designs associated with some distance-regular graphs,
    {\sl Discrete Appl. Math.} 157 (2009), 3038--3045.

\bibitem{Baileyimprimitive} Bailey, R.F., On the metric dimension of imprimitive distance-regular
    graphs, preprint (2013);
    \arxiv{1312.4971}.

\bibitem{Baileysmall}
%Bailey, R.F., The metric dimension of small distance-regular and strongly regular graphs, preprint (2013);
Bailey, R.F.,
The metric dimension of small distance-regular and strongly regular graphs,
{\sl Australas. J. Combin.} 62 (2015), 18--34;
\arxiv{1312.4973}.



\bibitem{Johnsonmetric} Bailey, R.F., C\'{a}ceres, J., Garijo, D.,
    Gonz\'{a}lez, A., M\'{a}rquez, A., Meagher, K., Puertas, M.L., Resolving sets for Johnson and Kneser graphs, {\sl European J. Combin.} 34 (2013), 736--751; \arxiv{1203.2660}.

\bibitem{Metricdimension} Bailey, R.F., Cameron, P.J., Base size, metric
    dimension and other invariants of groups and graphs, {\sl Bull. London Math. Soc.} 43 (2011), 209--242.

\bibitem{BaileyMeagher} Bailey, R.F., Meagher, K., On the metric dimension
    of Grassmann graphs, {\sl Discrete Math. Theor. Comput. Sci.} 13 (2011), 97--104;
    \arxiv{1010.4495}.


\bibitem{BBCGKS09} Ballinger, B., Blekherman, G., Cohn, H., Giansiracusa, N.,
    Kelly, E., Sch\"urmann, A., Experimental study of energy-minimizing point
    configurations on spheres, {\sl Exp. Math.} 18 (2009), 257--283;
\arxiv{math/0611451}.




\bibitem{BGR2010BLMS} Bamberg, J., Giudici, M., Royle, G.F., Every flock generalized quadrangle has a hemisystem,
{\sl Bull. London Math. Soc.} 42 (2010), 795--810;
    \arxiv{0912.2574}.


\bibitem{Bapre}  Bang, S., Geometric distance-regular graphs without 4-claws,
    {\sl Linear Algebra Appl.} 438 (2013), 37--46;
\arxiv{1101.0440}.

\bibitem{Bang2014} Bang, S., Distance-regular graphs with an eigenvalue $-k<\theta \leq 2-k$, {\sl Electron.
    J. Combin.} 21 (2014), P1.4.


\bibitem{BDK08} Bang, S., Van Dam, E.R., Koolen, J.H.,
    Spectral characterization of the Hamming graphs, {\sl Linear Algebra
    Appl.} 429 (2008), 2678--2686.

\bibitem{BaDuKoMo09}
%Bang, S., Dubickas, A., Koolen, J.H.,
%    Moulton, V., There are only finitely many distance-regular graphs of fixed valency greater than two,
%    {\sl Adv. Math.}, to appear;
Bang, S., Dubickas, A., Koolen, J.H., Moulton, V.,
There are only finitely many distance-regular graphs of fixed valency greater than two,
{\sl Adv. Math.} 269 (2015), 1--55;
\arxiv{0909.5253}.

\bibitem{BFK09} Bang, S., Fujisaki, T., Koolen, J.H., The
    spectra of the local graphs of the twisted Grassmann graphs,
    {\sl European J. Combin.} 30 (2009), 638--654.

\bibitem{BGK4claws} Bang, S., Gavrilyuk, A.L., Koolen, J.H., The distance-regular graphs without 4-claws, in
    preparation.

\bibitem{BHK06} % MR2186419 (2006g:05233)
Bang, S., Hiraki, A., Koolen, J.H., Improving diameter bounds for
distance-regular graphs, {\sl European J. Combin.} 27 (2006), 79--89.

\bibitem{BaHiKo07} Bang, S., Hiraki, A., Koolen, J.H., Delsarte
    clique graphs, {\sl European J. Combin.} 28 (2007),
    501--516.

\bibitem{BaHiKo10} Bang, S., Hiraki, A., Koolen, J.H.,
    Delsarte set graphs with small $c_2$, {\sl
    Graphs Combin.} 26 (2010), 147--162.




\bibitem{BK08} Bang, S., Koolen, J.H., Graphs cospectral with
    $H(3,q)$ which are locally disjoint union of at most three
    complete graphs, {\sl Asian-Eur. J. Math.} 1 (2008), 147--156.

\bibitem{BaKo14} Bang, S., Koolen, J.H., On geometric distance-regular graphs with
diameter three, {\sl European J. Combin.} 36 (2014), 331--341.

\bibitem{BaKo??} Bang, S., Koolen, J.H., A sufficient condition for
    distance-regular graphs to be geometric, in preparation.



\bibitem{BKM03} % MR2009392 (2004h:05131)
Bang, S., Koolen, J.H., Moulton, V., A bound for the number of columns $l\sb
{(c,a,b)}$ in the intersection array of a distance-regular graph, {\sl European
J. Combin.} 24 (2003), 785--795.

\bibitem{BaKoMo07} Bang, S., Koolen, J.H., Moulton, V., Two
    theorems concerning the Bannai-Ito conjecture, {\sl European J. Combin.} 28 (2007), 2026--2052.

\bibitem{BKP2014pre}
Bang, S., Koolen, J.H., Park, J., Some results on the eigenvalues
of distance-regular graphs, {\sl Graphs Combin.} 31 (2015),
1841--1853.

\bibitem{BB2005EJC} Bannai, E., Bannai, E., A note on the spherical embeddings
    of strongly regular graphs, {\sl European J. Combin.} 26 (2005),
    1177--1179.

\bibitem{BB2009EJC}
Bannai, E., Bannai, E.,
A survey on spherical designs and algebraic combinatorics on spheres,
{\sl European J. Combin.} 30 (2009), 1392--1425.

\bibitem{bi} Bannai, E., Ito, T., {\sl Algebraic
    Combinatorics I: Association Schemes},
    Ben\-ja\-min-Cummings, Menlo Park, 1984.

\bibitem{BI87} Bannai, E., Ito, T., On distance-regular
    graphs with fixed valency, {\sl Graphs Combin.} 3 (1987),
    95--109.

\bibitem{BI89} Bannai, E., Ito, T., On distance-regular
    graphs with fixed valency, IV, {\sl European J. Combin.} 10
    (1989), 137--148.



\bibitem{BeFa00} Beezer, R.A., Farrell, E.J., The matching polynomial of a
    distance-regular graph, {\sl Int. J. Math. Math. Sci.} %this is not a typo
    23 (2000), 89--97.


\bibitem{Bels98} Belsley, E.D., Rates of convergence of random walk on distance
    regular graphs, {\sl Probab. Theory Related Fields} 112 (1998), 493--533.


\bibitem{BF98} % MR1631759 (99h:05126)
Bending, T.D., Fon-Der-Flaass, D., Crooked functions, bent functions, and
distance regular graphs, {\sl Electron. J. Combin.} 5 (1998), R34.

\bibitem{BCEM12} Bendito, E., Carmona, A., Encinas, A.M., Mitjana, M.,
    Distance-regular graphs having the $M$-property, {\sl Linear Multilinear
    Algebra} 60 (2012), 225--240.

\bibitem{BKMT2008IJQI}
Best, A., Kliegl, M., Mead-Gluchacki, S., Tamon, C.,
Mixing of quantum walks on generalized hypercubes,
{\sl Int. J. Quantum Inf.} 6 (2008), 1135--1148;
\arxiv{0808.2382}.

\bibitem{Bier1987DM}
Bier, T.,
A family of nonbinary linear codes,
{\sl Discrete Math.} 65 (1987), 47--51.

\bibitem{Bierbrauer} Bierbrauer, J., A family of crooked
    functions, {\sl Des. Codes Cryptogr.} 50 (2009),
    235--241.

\bibitem{biggs} Biggs, N., {\sl Algebraic Graph Theory},
    Cambridge University Press, Cambridge, 1974, second
    edition, 1993.



\bibitem{biggsp} Biggs, N.L., Potential theory on distance-regular graphs, {\sl
    Comb. Probab. Comput.} 2 (1993), 243--255.
    Also: {\sl Combinatorics, Geometry and Probability: A Tribute to Paul Erd\H{o}s}
    (B. Bollob\'{a}s, A. Thomason, eds.), Cambridge University Press, Cambridge, 1997, pp.~107--119.

\bibitem{Biggschipfiring} Biggs, N., Chip firing on distance-regular graphs,
    {\sl CDAM Research Report Series}, LSE-CDAM-96-11, 1996.

\bibitem{biggs97} Biggs, N., Algebraic potential theory on graphs, {\sl Bull.
    London Math. Soc.} 29 (1997), 641--682.

\bibitem{BBS} Biggs, N.L., Boshier, A.G., Shawe-Taylor, J., Cubic
    distance-regular graphs, {\sl J. London Math. Soc.} (2) 33 (1986),
    385--394.

\bibitem{Billio} Billio, M., Cal\`{e}s, L., Gu\'{e}gan, D., Portfolio
    symmetry and momentum, {\sl European J. Oper. Res.} 214 (2011),
    759--767.

\bibitem{BlBr97} Blokhuis, A., Brouwer, A.E., Determination of the distance-regular graphs without $3$-claws,
  {\sl Discrete Math.} 163 (1997), 225--227.

\bibitem{BlokhuisBH07} Blokhuis, A., Brouwer, A.E.,
    Haemers, W.H., On 3-chromatic distance-regular graphs,
    {\sl Des. Codes Cryptography} 44 (2007), 293--305.



\bibitem{bloom} Bloom, G.S., Quintas, L.W., Kennedy, J.W.,
    Distance degree regular graphs, {\sl The Theory and Applications of
    Graphs, Proceedings of the 4th international conference on the theory and applications of graphs, Kallamazoo,
    1980} (G. Chartrand et al., eds.), Wiley, New York, 1981, pp.~95--108.

\bibitem{Bockting-Conrad2012LAA}
Bockting-Conrad, S.,
Two commuting operators associated with a tridiagonal pair,
{\sl Linear Algebra Appl.} 437 (2012), 242--270;
\arxiv{1110.3434}.

\bibitem{vanbon07} Van Bon, J., Finite primitive
    distance-transitive graphs, {\sl European J. Combin.} 28 (2007), 517--532.

\bibitem{BB1988P} Van Bon, J.T.M., Brouwer, A.E., The distance-regular
    antipodal covers of classical distance-regular graphs, {\sl Combinatorics}
    (A. Hajnal, L. Lov\'{a}sz, V.T. S\'{o}s, eds.),
    Colloquia Mathematica Societatis J\'{a}nos Bolyai, vol.~52,
    North-Holland, Amsterdam, 1988, pp.~141--166.

\bibitem{BondyMurty} Bondy, J.A., Murty, U.S.R., {\sl Graph Theory},
Graduate Texts in Mathematics, vol.~244,
    second edition, Springer, New York, 2008.

\bibitem{BR2000IEEE}
Borges, J., Rif\`{a}, J.,
On the nonexistence of completely transitive codes,
{\sl IEEE Trans. Inform. Theory} 46 (2000), 279--280.

 \bibitem{BRZ2001IEEE}
Borges, J., Rif\`{a}, J., Zinoviev, V.A.,
Nonexistence of completely transitive codes with error-correcting capability $e>3$,
{\sl IEEE Trans. Inform. Theory} 47 (2001), 1619--1621.

\bibitem{BoRiZiDM08}
Borges, J., Rif\`{a}, J., Zinoviev, V.A.,
On non-antipodal binary completely regular codes,
{\sl Discrete Math.} 308 (2008), 3508--3525.

\bibitem{BRZ2010AMC}
Borges, J., Rif\`{a}, J., Zinoviev, V.A.,
On $q$-ary linear completely regular codes with $\rho=2$ and antipodal dual,
{\sl Adv. Math. Commun.} 4 (2010), 567--578;
\arxiv{1002.4510}.

\bibitem{BRZ2014DCC} Borges, J., Rif\`{a}, J., Zinoviev, V.A., New families of completely regular codes and
    their corresponding distance regular coset graphs, {\sl Des. Codes Cryptogr.} 70 (2014), 139--148.

\bibitem{Bose} Bose, R.C., Strongly regular graphs, partial geometries and
    partially balanced designs, {\sl Pacific J. Math.} 13 (1963), 389--419.

\bibitem{BBMM08} Bracken, C., Byrne, E., Markin, N., McGuire,
    G., A few more quadratic APN functions, {\sl Cryptogr. Commun.}
    3 (2011), 43--53;
    \arxiv{0804.4799}.


\bibitem{BKOW2013pre}
Braun, M., Kohnert, A.,  \"{O}sterg\r{a}rd, P.R.J., Wassermann, A.,
Large sets of $t$-designs over finite fields,
{\sl J. Combin. Theory Ser. A} 124 (2014), 195--202;
\arxiv{1305.1455}.

\bibitem{Brouwer1981} Brouwer, A.E., The nonexistence of a regular near hexagon on $1408$ points,
{\sl Math. Centr. Report} ZW163, Amsterdam (1981).

\bibitem{Brouwer1983IEEE}
Brouwer, A.E.,
On the uniqueness of a certain thin near octagon (or partial $2$-geometry, or parallelism) derived from the binary Golay code,
{\sl IEEE Trans. Inform. Theory} 29 (1983), 370--371.

\bibitem{AEBSoicher} Brouwer, A.E., The Soicher graph - an
    antipodal $3$-cover of the second subconstituent of the McLaughlin graph,
    manuscript (1990).

\bibitem{Brouwer1990DM}
Brouwer, A.E.,
A note on completely regular codes,
{\sl Discrete Math.} 83 (1990), 115--117.

\bibitem{Brouwer1993DM}
Brouwer, A.E.,
On complete regularity of extended codes,
{\sl Discrete Math.} 117 (1993), 271--273.



\bibitem{BCNcoradd} Brouwer, A.E., Corrections and
    additions to the book `Distance-regular Graphs',
    \url{http://www.win.tue.nl/~aeb/drg/BCN-ac.ps.gz}
    (October 2008).



\bibitem{tables} Brouwer, A.E., Parameters of distance-regular
    graphs, \url{http://www.win.tue.nl/~aeb/drg/drgtables.html} (June 2011).


\bibitem{webchromatic} Brouwer, A.E., Cube-like graphs,
    \url{http://www.win.tue.nl/~aeb/graphs/cubelike.html} (January 2012).





\bibitem{bcohen} Brouwer, A.E., Cohen, A.M., Local recognition of Tits geometries of classical type,
{\sl Geom. Dedicata} 20 (1986), 181--199.

\bibitem{bcn} Brouwer, A.E., Cohen, A.M., Neumaier, A.,
    {\sl Distance-Regular Graphs}, Springer-Verlag, Berlin,
    1989.

\bibitem{BrEt11} Brouwer, A.E., Etzion, T., Some new distance-$4$ constant
    weight codes, {\sl Adv. Math. Commun.} 5 (2011),
    417--424.

\bibitem{BF2014pre}
%Brouwer, A.E., Fiol, M.A.,
%Distance-regular graphs where the distance-$d$ graph has fewer distinct eigenvalues,
%preprint (2014);
Brouwer, A.E., Fiol, M.A.,
Distance-regular graphs where the distance-$d$ graph has fewer distinct eigenvalues,
{\sl Linear Algebra Appl.} 480 (2015), 115--126;
\arxiv{1409.0389}.

\bibitem{BGKM03} Brouwer, A.E., Godsil, C.D., Koolen, J.H.,
    Martin, W.J., Width and dual width of subsets in polynomial
    association schemes,  {\sl J. Combin. Theory Ser. A} 102 (2003), 255--271.

\bibitem{BH93} Brouwer, A.E., Haemers, W.H., The Gewirtz
    graph: An exercise in the theory of graph spectra, {\sl European
    J. Combin.} 14 (1993), 397--407.

\bibitem{bh95} Brouwer, A.E., Haemers, W.H.,
    Association schemes, {\sl Handbook of Combinatorics}
    Vol.~1, 2 (R.L.~Graham, M.~Gr\"{o}tschel, L.~Lov\'{a}sz, eds.), Elsevier, Amsterdam, 1995, pp.~747--771.

\bibitem{BH05} Brouwer, A.E., Haemers, W.H., Eigenvalues and perfect matchings,
    {\sl Linear Algebra Appl.} 395 (2005), 155--162.

\bibitem{BrHa} Brouwer, A.E., Haemers, W.H., {\sl Spectra of Graphs}, Springer, New York, 2012;
    \url{http://homepages.cwi.nl/~aeb/math/ipm/}.

\bibitem{BH1992EJC}
Brouwer, A.E., Hemmeter, J.,
A new family of distance-regular graphs and the $\{0,1,2\}$-cliques in dual polar graphs,
{\sl European J. Combin.} 13 (1992), 71--79.

\bibitem{BHW1995EJC} Brouwer, A.E., Hemmeter, J., Woldar, A.,
The complete list of maximal cliques of
    $\mathrm{Quad}(n,q)$, $q$ odd, {\sl European J. Combin.} 16 (1995), 107--110.

\bibitem{BrJuKo08} Brouwer, A.E., Juri\v si\'c, A., Koolen,  J.H.,
    Characterization of the Patterson graph, {\sl J. Algebra} 320 (2008),
    1878--1886.

\bibitem{BK99} Brouwer, A.E., Koolen, J.H., The distance-regular graphs of
    valency four, {\sl J. Algebraic Combin.} 10 (1999), 5--24.

\bibitem{BrKo09} Brouwer, A.E., Koolen, J.H., The vertex-connectivity
    of a distance-regular graph, {\sl European J. Combin.} 30 (2009), 668--673.

\bibitem{BKR98} % MR1648472 (99g:05184)
Brouwer, A.E., Koolen, J.H., Riebeek, R.J., A new distance-regular graph
associated to the Mathieu group $M\sb {10}$, {\sl J. Algebraic Combin.} 8
(1998), 153--156.

\bibitem{BN88} Brouwer, A.E., Neumaier, A.,
A remark on partial linear spaces of girth 5 with an application to strongly regular graphs, {\sl Combinatorica} 8 (1988), 57--61.

\bibitem{BP2011} Brouwer, A.E., Pasechnik, D.V., Two distance-regular graphs,
    {\sl J. Algebraic Combin.} 36 (2012), 403--407;
    \arxiv{1107.0475}.

\bibitem{BWilbrink} Brouwer, A.E., Wilbrink, H.A., The structure of near polygons with quads,
{\sl Geom. Dedicata} 14 (1983), 145--176.

\bibitem{Brown2013pre}
Brown, G.M.F.,
Hypercubes, Leonard triples and the anticommutator spin algebra,
preprint (2013);
\arxiv{1301.0652}.

\bibitem{BCL08} Budaghyan, L., Carlet, C., Leander, G., Two classes of
    quadratic APN binomials inequivalent to power functions, {\sl IEEE Trans. Inform. Theory} 54 (2008), 4218--4229.

\bibitem{BCL09} Budaghyan, L., Carlet, C., Leander, G.,
    Constructing new APN functions from known ones, {\sl Finite
    Fields Appl.} 15 (2009), 150--159.

\bibitem{BN1992MC} Bussemaker, F.C., Neumaier, A., Exceptional graphs with
    smallest eigenvalue $-2$ and related problems, {\sl Math. Comp.} 59 (1992),
    583--608.

\bibitem{DeCaenFonDerFlaass} De Caen, D.,
    Fon-Der-Flaass, D., Distance regular covers of complete graphs
    from Latin squares, {\sl Des. Codes Cryptogr.} 34 (2005), 149--153.

\bibitem{CMM95} % MR1346887 (96j:05115)
De Caen, D., Mathon, R., Moorhouse, G.E., A family of antipodal
distance-regular graphs related to the classical Preparata codes, {\sl J.
Algebraic Combin.} 4 (1995), 317--327.

\bibitem{CDDFS2013JCTA}
C\'{a}mara, M., Dalf\'{o}, C., Delorme, C., Fiol, M.A., Suzuki, H.,
Edge-distance-regular graphs are distance-regular,
{\sl J. Combin. Theory Ser. A} 120 (2013), 1057--1067;
\arxiv{1210.5649}.

\bibitem{CDKP2013} C\'{a}mara, M., Van Dam, E.R., Koolen, J.H., Park, J.,
Geometric aspects of $2$-walk-regular graphs, {\sl Linear Algebra Appl.} 439 (2013), 2692--2710;
\arxiv{1304.2905}.

\bibitem{CFFG2009EJC}
C\'{a}mara, M., F\`{a}brega, J., Fiol, M.A., Garriga, E.,
Some families of orthogonal polynomials of a discrete variable and their applications to graphs and codes,
{\sl Electron. J. Combin.} 16 (2009), R83.

\bibitem{CFFG2010EJC}
C\'{a}mara, M., F\`{a}brega, J., Fiol, M.A., Garriga, E.,
Combinatorial vs. algebraic characterizations of completely pseudo-regular codes,
{\sl Electron. J. Combin.} 17 (2010), R37.

\bibitem{CFFG2014DAM}
C\'{a}mara, M., F\`{a}brega, J., Fiol, M.A., Garriga, E.,
On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes,
{\sl Discrete Appl. Math.} 176 (2014), 12--18;
\arxiv{1212.3815}.

\bibitem{CGS1978NAWIM}
Cameron, P.J., Goethals, J.-M., Seidel, J.J.,
The Krein condition, spherical designs, Norton algebras and permutation groups,
{\sl Nederl. Akad. Wetensch. Indag. Math.} 40 (1978), 196--206.

\bibitem{CGS1978JA}
Cameron, P.J., Goethals, J.-M., Seidel, J.J.,
Strongly regular graphs having strongly regular subconstituents,
{\sl J. Algebra} 55 (1978), 257--280.

\bibitem{CK2008JAMS}
Cameron, P.J., Kazanidis, P.A.,
Cores of symmetric graphs,
{\sl J. Aust. Math. Soc.} 85 (2008), 145--154.

\bibitem{Cau97}  Caughman IV, J.S., Intersection numbers of bipartite
    distance-regular graphs, {\sl Discrete Math.} 163 (1997), 235--241.

\bibitem{Caughman1998GC}
Caughman IV, J.S.,
Spectra of bipartite $P$- and $Q$-polynomial association schemes,
{\sl Graphs Combin.} 14 (1998), 321--343.

\bibitem{Caughman1999DM} Caughman IV, J.S., The Terwilliger algebras of
    bipartite $P$- and $Q$-polynomial schemes, {\sl Discrete Math.} 196 (1999),
    65--95.

\bibitem{Caughman1999JCTB}
Caughman IV, J.S.,
Bipartite $Q$-polynomial quotients of antipodal distance-regular graphs,
{\sl J. Combin. Theory Ser. B} 76 (1999), 291--296.

\bibitem{Caughman2003EJC}
Caughman IV, J.S.,
The last subconstituent of a bipartite $Q$-polynomial distance-regular graph,
{\sl European J. Combin.} 24 (2003), 459--470.

\bibitem{Caughman2004GC} Caughman IV, J.S., Bipartite $Q$-polynomial
    distance-regular graphs, {\sl Graphs Combin.} 20 (2004), 47--57.

\bibitem{CMT2005DM} Caughman IV, J.S., MacLean, M.S., Terwilliger, P., The
    Terwilliger algebra of an almost-bipartite $P$- and $Q$-polynomial
    association scheme, {\sl Discrete Math.} 292 (2005), 17--44;
    \arxiv{math/0508401}.

\bibitem{CW2005JAC}
Caughman IV, J.S., Wolff, N.,
The Terwilliger algebra of a distance-regular graph that supports a spin model,
{\sl J. Algebraic Combin.} 21 (2005), 289--310.

\bibitem{Cerzo2010LAA}
Cerzo, D.R.,
Structure of thin irreducible modules of a $Q$-polynomial distance-regular graph,
{\sl Linear Algebra Appl.} 433 (2010), 1573--1613;
\arxiv{1003.5368}.

\bibitem{CS2009EJC}
Cerzo, D.R., Suzuki, H.,
Non-existence of imprimitive $Q$-polynomial schemes of exceptional type with $d=4$,
{\sl European J. Combin.} 30 (2009), 674--681.

\bibitem{Chan2013pre}
Chan, A.,
Complex Hadamard matrices, instantaneous uniform mixing and cubes,
preprint (2013);
\arxiv{1305.5811}.

\bibitem{CGM2003TAMS}
Chan, A., Godsil, C., Munemasa, A.,
Four-weight spin models and Jones pairs,
{\sl Trans. Amer. Math. Soc.} 355 (2003), 2305--2325;
\arxiv{math/0111035}.

\bibitem{comcov} Chandra, A.K., Raghavan, P., Ruzzo, W.L., Smolensky, R.,
    Tiwari, P., The electrical resistance of a graph captures its commute and
    cover times, {\sl Comput. Complexity} 6 (1996), 312--340.


\bibitem{CP1991CMP}
Chari, V., Pressley, A.,
Quantum affine algebras,
{\sl Comm. Math. Phys.} 142 (1991), 261--283.

\bibitem{CH99} % MR1677987 (99m:05169)
Chen, Y., Hiraki, A., On the non-existence of certain distance-regular graphs,
{\sl Kyushu J. Math.} 53 (1999), 1--15.

\bibitem{CHK98} % MR1645439 (99g:05186)
Chen, Y., Hiraki, A., Koolen, J.H., On distance-regular graphs with $c\sb 4=1$
and $a\sb 1\ne a\sb 2$, {\sl Kyushu J. Math.} 52 (1998), 265--277.


\bibitem{Chihara1987SIAM}
Chihara, L.,
On the zeros of the Askey-Wilson polynomials, with applications to coding theory,
{\sl SIAM J. Math. Anal.} 18 (1987), 191--207.



\bibitem{CS1995GC}
Chihara, L., Stanton, D.,
A matrix equation for association schemes,
{\sl Graphs Combin.} 11 (1995), 103--108.

\bibitem{Chvatalmetric} Chv\'{a}tal, V., Mastermind, {\sl Combinatorica} 3
    (1983), 325--329.

\bibitem{Chvatal} Chv\'{a}tal, V., Comparison of two techniques for proving
    nonexistence of strongly regular graphs, {\sl Graphs Combin.} 27 (2011), 171--175;
\arxiv{0906.5389}.


\bibitem{CKK12} Cioab\u{a}, S.M., Kim, K., Koolen, J.H., On a conjecture of
    Brouwer involving the connectivity of strongly regular graphs, {\sl J.
    Combin. Theory Ser. A} 119 (2012), 904--922;
\arxiv{1105.0796}.


\bibitem{CioaKopre} Cioab\u{a}, S.M., Koolen, J.H., On the connectedness of the complement of a ball in distance-regular graphs, {\sl J. Algebraic Combin.} 38 (2013), 191--195.


\bibitem{cohen04} Cohen, A.M., Distance-transitive graphs,
    {\sl Topics in Algebraic Graph Theory} (L.W. Beineke et al., eds.), Cambridge University Press, Cambridge, 2004,
    pp.~222--249.


\bibitem{CPsrg}
Cohen, N., Pasechnik, D.V., Implementing Brouwer's database of
strongly regular graphs, preprint (2016);
\arxiv{1601.00181}.




\bibitem{CEKS10} Cohn, H., Elkies, N.D., Kumar, A., Sch\"urmann, A., Point
    configurations that are asymmetric yet balanced, {\sl Proc. Amer. Math.
    Soc.} 138 (2010), 2863--2872;
\arxiv{0812.2579}.

\bibitem{CK07} Cohn, H., Kumar, A., Universally optimal distribution of points
    on spheres,  {\sl J. Amer. Math. Soc.} 20 (2007), 99--148;
\arxiv{math/0607446}.

\bibitem{CD2007B}
Colbourn, C.J., Dinitz, J.H. (Eds.),
{\sl Handbook of Combinatorial Designs}, second edition,
Chapman \& Hall/CRC, Boca Raton, FL, 2007.

\bibitem{Collins1997GC}
Collins, B.V.C.,
The girth of a thin distance-regular graph,
{\sl Graphs Combin.} 13 (1997), 21--30.

\bibitem{Collins2000DM}
Collins, B.V.C.,
The Terwilliger algebra of an almost-bipartite distance-regular graph and its antipodal $2$-cover,
{\sl Discrete Math.} 216 (2000), 35--69.

\bibitem{Co95} Coolsaet, K., Local structure of graphs with $\lambda=\mu=2,$ $a_2=4$, {\sl Combinatorica} 15 (1995), 481--487.

\bibitem{Co05} % MR2127691 (2005k:05242)
Coolsaet, K., A distance regular graph with intersection array $(21,
16, 8; 1, 4, 14)$ does not exist, {\sl European J. Combin.} 26
(2005), 709--716.

\bibitem{CooDe05} Coolsaet, K., Degraer, J., A computer-assisted proof of the
    uniqueness of the Perkel graph, {\sl Des. Codes Cryptogr.} 34 (2005), 155--171.


\bibitem{CoJu08} Coolsaet, K., Juri\v{s}i\'{c}, A., Using equality in the Krein
    conditions to prove the nonexistence of certain distance-regular graphs,
    {\sl J. Combin. Theory Ser. A} 115 (2008), 1086--1095.

\bibitem{CoJuKo08EuJC} Coolsaet, K., Juri\v{s}i\'{c}, A., Koolen, J.H.,  On
    triangle-free distance-regular graphs with an eigenvalue multiplicity equal
    to the valency, {\sl European J. Combin.} 29 (2008), 1186--1199.

\bibitem{Cossidente2013JAC}
Cossidente, A.,
Relative hemisystems on the Hermitian surface,
{\sl J. Algebraic Combin.} 38 (2013), 275--284.

\bibitem{CP2005JLMS}
Cossidente, A., Penttila, T.,
Hemisystems on the Hermitian surface,
{\sl J. London Math. Soc.} 72 (2005), 731--741.

\bibitem{CGGV14}
%Coutinho, G., Godsil, C., Guo, K., Vanhove, F.,
%Perfect state transfer on distance-regular graphs and association schemes, preprint (2014);
Coutinho, G., Godsil, C., Guo, K., Vanhove, F.,
Perfect state transfer on distance-regular graphs and association schemes,
{\sl Linear Algebra Appl.} 478 (2015), 108--130;
\arxiv{1401.1745}.



\bibitem{Curtin1998DM} Curtin, B., $2$-Homogeneous bipartite distance-regular
    graphs, {\sl Discrete Math.} 187 (1998), 39--70.

\bibitem{Curtin1999GC}
Curtin, B.,
Bipartite distance-regular graphs, I,
{\sl Graphs Combin.} 15 (1999), 143--158;
II,
{\sl Graphs Combin.} 15 (1999), 377--391.

\bibitem{Curtin1999EJC}
Curtin, B.,
The local structure of a bipartite distance-regular graph,
{\sl European J. Combin.} 20 (1999), 739--758.

\bibitem{Curtin1999DM}
Curtin, B.,
Distance-regular graphs which support a spin model are thin,
{\sl Discrete Math.} 197/198 (1999), 205--216.

\bibitem{Curtin2000EJC}
Curtin, B.,
Almost $2$-homogeneous bipartite distance-regular graphs,
{\sl European J. Combin.} 21 (2000), 865--876.

\bibitem{Curtin2001JCTB}
Curtin, B.,
The Terwilliger algebra of a $2$-homogeneous bipartite distance-regular graph,
{\sl J. Combin. Theory Ser. B} 81 (2001), 125--141.

\bibitem{Curtin2007RJ}
Curtin, B.,
Spin Leonard pairs,
{\sl Ramanujan J.} 13 (2007), 319--332.

\bibitem{Curtin2007LAA}
Curtin, B.,
Modular Leonard triples,
{\sl Linear Algebra Appl.} 424 (2007), 510--539.

\bibitem{CN1999JCTB}
Curtin, B., Nomura, K.,
Some formulas for spin models on distance-regular graphs,
{\sl J. Combin. Theory Ser. B} 75 (1999), 206--236.

\bibitem{CN2000JAC}
Curtin, B., Nomura, K.,
Distance-regular graphs related to the quantum enveloping algebra of $sl(2)$,
{\sl J. Algebraic Combin.} 12 (2000), 25--36.

\bibitem{CN2004JAC}
Curtin, B., Nomura, K.,
Homogeneity of a distance-regular graph which supports a spin model,
{\sl J. Algebraic Combin.} 19 (2004), 257--272.

\bibitem{CN2005JCTB}
Curtin, B., Nomura, K.,
$1$-Homogeneous, pseudo-$1$-homogeneous, and $1$-thin distance-regular graphs,
{\sl J. Combin. Theory Ser. B} 93 (2005), 279--302.

\bibitem{Cuypers92} Cuypers, H., The dual of Pasch's axiom, {\sl European J.
    Combin.} 13 (1992), 15--31.



\bibitem{C70} Cvetkovi\'c, D.M., New characterizations of the
    cubic lattice graphs, {\sl Publ. Inst. Math. (Beograd)} 10 (1970),
    195--198.

\bibitem{CDS} Cvetkovi\'c, D., Doob, M., Sachs, H., {\sl Spectra of Graphs},
    Academic Press, New York, 1980.


\bibitem{dalfoperturbation} Dalf\'{o}, C., Van
    Dam, E.R., Fiol, M.A., On perturbations of almost distance-regular
    graphs, {\sl Linear Algebra Appl.} 435 (2011), 2626--2638;
    \arxiv{1202.3313}.


\bibitem{dalfodual} Dalf\'{o}, C., Van
    Dam, E.R., Fiol, M.A., Garriga, E., Dual concepts of almost distance-regularity
    and the spectral excess theorem, {\sl Discrete Math.} 312 (2012), 2730--2734;
    \arxiv{1207.3606}.



\bibitem{DalfoDamFiol} Dalf\'{o}, C., Van Dam, E.R.,
    Fiol, M.A.,
    Garriga, E., Gorissen, B.L., On almost distance-regular graphs,
    {\sl J. Combin. Theory Ser. A} 118 (2011), 1094--1113;
    \arxiv{1202.3265}.


\bibitem{DaFiGa09} Dalf\'{o}, C., Fiol, M.A., Garriga, E.,
    On $k$-walk-regular graphs, {\sl Electron. J. Combin.}
    16:1 (2009), R47.





\bibitem{Damexcess} Van Dam, E.R., The spectral excess theorem
    for distance-regular graphs: a global (over)view, {\sl
    Electron. J. Combin.} 15 (2008), R129.


\bibitem{damfiol12} Van Dam, E.R., Fiol, M.A., A short proof of the odd-girth
    theorem, {\sl
    Electron. J. Combin.} 19:3 (2012), P12;
    \arxiv{1205.0153}.

\bibitem{DFLaplacian}
Van Dam, E.R., Fiol, M.A.,
The Laplacian spectral excess theorem for distance-regular graphs, {\sl Linear Algebra Appl.} 458 (2014), 245--250;
\arxiv{1405.0169}.


\bibitem{EF00} Van Dam, E.R., Fon-Der-Flaass, D., Uniformly packed codes and
    more distance regular graphs from crooked functions, {\sl J. Algebraic
    Combin.} 12 (2000), 115--121.

\bibitem{EF03} % MR1957967 (2004b:05206)
Van Dam, E.R., Fon-Der-Flaass, D., Codes, graphs, and schemes from nonlinear
functions, {\sl European J. Combin.} 24 (2003), 85--98.

\bibitem{DH97} % MR1456585 (98d:05152)
Van Dam, E.R., Haemers, W.H., A characterization of distance-regular graphs
with diameter three, {\sl J. Algebraic Combin.} 6 (1997), 299--303.


\bibitem{DH02} % MR1887234 (2002k:05247)
Van Dam, E.R., Haemers, W.H., Spectral characterizations of some
distance-regular graphs, {\sl J. Algebraic Combin.} 15 (2002), 189--202.


\bibitem{DH03} Van Dam, E.R., Haemers, W.H., Which graphs are
    determined by their spectrum?, {\sl Linear Algebra Appl.}
    373 (2003), 241--272.

\bibitem{DH09} Van Dam, E.R., Haemers, W.H., Developments on
    spectral characterizations of graphs, {\sl Discrete Math.}
    309 (2009), 576--586.

\bibitem{DHodd} Van Dam, E.R., Haemers, W.H., An odd
    characterization of the generalized odd graphs,
    {\sl J. Combin. Theory Ser. B} 101 (2011), 486--489;
    \arxiv{1202.2300}.

\bibitem{DHKS06} Van Dam, E.R., Haemers, W.H., Koolen, J.H.,
    Spence, E., Characterizing distance-regularity of graphs by the
    spectrum, {\sl J. Combin. Theory Ser. A} 113 (2006),
    1805--1820.


\bibitem{DK05} % MR2198328 (2006j:05216)
Van Dam, E.R., Koolen, J.H., A new family of distance-regular graphs with
unbounded diameter, {\sl Invent. Math.} 162 (2005), 189--193.

\bibitem{DMM2010pre} Van Dam, E.R., Martin, W.J., Muzychuk, M.E., Uniformity in
    association schemes and coherent configurations: cometric $Q$-antipodal
    schemes and linked systems, {\sl J. Combin. Theory Ser. A} 120 (2013), 1401--1439;
    \arxiv{1001.4928}.



\bibitem{DS12}
%Van Dam, E.R., Sotirov, R.,
%On bounding the bandwidth of graphs with symmetry,
%    {\sl INFORMS J. Comput.}, to appear;
Van Dam, E.R., Sotirov, R.,
On bounding the bandwidth of graphs with symmetry,
{\sl INFORMS J. Comput.} 27 (2015), 75--88;
\arxiv{1212.0694}.

\bibitem{DS13}
%Van Dam, E.R., Sotirov, R.,
%Semidefinite programming and eigenvalue bounds for the graph partition problem,
%    {\sl Math. Program. Ser. B}, to appear;
Van Dam, E.R., Sotirov, R.,
Semidefinite programming and eigenvalue bounds for the graph partition problem,
{\sl Math. Program. Ser. B} 151 (2015), 379--404;
\arxiv{1312.0332}.

\bibitem{BDMR2014pre}
%De Beule, J., Demeyer, J., Metsch, K., Rodgers, M.,
%A new family of tight sets in $\mathcal{Q}^+(5,q)$,
%preprint (2014);
De Beule, J., Demeyer, J., Metsch, K., Rodgers, M.,
A new family of tight sets in $\mathcal{Q}^+(5,q)$,
{\sl Des. Codes Cryptogr.} 78 (2016), 655--678;
\arxiv{1409.5634}.

\bibitem{DBr06a} De Bruyn, B., The completion of the
    classification of the regular near octagons with thick
    quads,
{\sl J. Algebraic Combin.} 24 (2006), 23--29.

\bibitem{DeB2010ElJC}  De Bruyn, B., The nonexistence of regular near octagons
    with parameters $(s,t,t_2,t_3)=(2,24,0,8)$, {\sl Electron. J. Combin.} 17
    (2010), R149.

\bibitem{DBS10} De Bruyn, B., Suzuki, H., Intriguing sets of vertices of regular graphs, {\sl Graphs Combin.} 26 (2010), 629--646.

\bibitem{DeBVhpre} De Bruyn, B., Vanhove, F., Inequalities for regular near polygons, with applications to $m$-ovoids,
    {\sl European J. Combin.} 34 (2013), 522--538.

\bibitem{DV2012pre}
%De Bruyn, B., Vanhove, F.,
%On $Q$-polynomial regular near $2d$-gons, {\sl Combinatorica},
%    to appear.
De Bruyn, B., Vanhove, F.,
On $Q$-polynomial regular near $2d$-gons,
{\sl Combinatorica} 35 (2015), 181--208.

\bibitem{DeDeKuTo06} De Clerck, F., De Winter, S., Kuijken, E.,
    Tonesi, C.,
    Distance-regular $(0,\alpha)$-reguli, {\sl Des. Codes
    Cryptogr.} 38 (2006), 179--194.

\bibitem{Deg07} Degraer, J., {\sl Isomorph-free exhaustive
    generation algorithms for association schemes}, thesis,
    Ghent University, 2007.

\bibitem{DegraerCoolsaet} Degraer, J., Coolsaet, K.,
    Classification of three-class association schemes using
    backtracking with dynamical variable ordering, {\sl Discrete
    Math.} 300 (2005), 71--81.


\bibitem{del} Delsarte, P., An algebraic approach to the association schemes of
    coding theory, {\sl Philips Res.\ Reports Suppl.} 10 (1973).

\bibitem{Delsarte1976JCTA}
Delsarte, P.,
Association schemes and $t$-designs in regular semilattices,
{\sl J. Combin. Theory Ser. A} 20 (1976), 230--243.


\bibitem{D} Delsarte, P., Bilinear forms over a finite field
    with applications to coding theory, {\sl J. Combin. Theory Ser. A}
    25 (1978), 226--241.

\bibitem{DG} Delsarte, P., Goethals, J.-M., Alternating
    bilinear forms over $GF(q)$, {\sl J. Combin. Theory Ser. A} 19
    (1975), 26--50.

\bibitem{DL1998IEEE} Delsarte, P., Levenshtein, V.I., Association schemes and
    coding theory, {\sl IEEE Trans. Inform. Theory} 44 (1998), 2477--2504.

\bibitem{DevSb90} Devroye, L., Sbihi, A., Random walks on highly symmetric
    graphs, {\sl J. Theoret. Probab.} 3 (1990), 497--514.


\bibitem{DiSaCo} Diaconis, P., Saloff-Coste, L., Separation cut-offs
    for birth and death chains, {\sl Ann. Appl. Probab.} 16 (2006), 2098--2122;
    \arxiv{math/0702411}.


\bibitem{DiaSha87} Diaconis, P., Shahshahani, M., Time to reach stationarity in
    the Bernoulli-Laplace diffusion model, {\sl SIAM J. Math. Anal.} 18 (1987),
    208--218.

\bibitem{Dickie1995D} Dickie, G.A., {\sl $Q$-polynomial structures for
    association
    schemes and distance-regular graphs}, thesis, University of Wisconsin,
    1995.

\bibitem{DT1996EJC} Dickie, G.A., Terwilliger, P., Dual bipartite
    $Q$-polynomial distance-regular graphs, {\sl European J. Combin.} 17
    (1996), 613--623.

\bibitem{DT1998JAC} Dickie, G.A., Terwilliger, P., A note on thin
    $P$-polynomial and dual-thin $Q$-polynomial symmetric association schemes,
    {\sl J. Algebraic Combin.} 7 (1998), 5--15.


\bibitem{doysne}
Doyle, P.G., Snell, J.L.,
{\sl Random Walks and Electric Networks},
Mathematical Association of America, Washington, DC, 1984;
    \url{http://www.stanford.edu/class/msande337/notes/walks.pdf}.

\bibitem{DrHeRo} Driscoll, J.R., Healy Jr., D.M., Rockmore, D.N., Fast discrete
    polynomial transforms with applications to data analysis for distance
    transitive graphs, {\sl SIAM J. Comput.} 26 (1997), 1066--1099.

\bibitem{Dunkl1976IUMJ}
Dunkl, C.F.,
A Krawtchouk polynomial addition theorem and wreath products of symmetric groups,
{\sl Indiana Univ. Math. J.} 25 (1976), 335--358.

\bibitem{Dunkl1978SIAM}
Dunkl, C.F.,
An addition theorem for Hahn polynomials: the spherical functions,
{\sl SIAM J. Math. Anal.} 9 (1978), 627--637.

\bibitem{Dunkl1978MM}
Dunkl, C.F.,
An addition theorem for some $q$-Hahn polynomials,
{\sl Monatsh. Math.} 85 (1978), 5--7.

\bibitem{Dunkl1979P}
Dunkl, C.F.,
Orthogonal functions on some permutation groups,
{\sl Relations Between Combinatorics and Other Parts of Mathematics} (D.K. Ray-Chaudhuri, ed.),
Proceedings of Symposia in Pure Mathematics, vol.~XXXIV,
American Mathematical Society, Providence, RI, 1979, pp.~129--147.

\bibitem{Edel} Edel, Y., On some representations of quadratic APN functions and
    dimensional dual hyperovals, {\sl RIMS K\^{o}ky\^{u}roku} 1687 (2010),
    118--130.

\bibitem{E-b1} Egawa, Y., Characterization of $H(n,q)$ by the
    parameters, {\sl J. Combin. Theory Ser. A} 31 (1981), 108--125.

\bibitem{E} Egawa, Y., Association schemes of quadratic
    forms,
    {\sl J. Combin. Theory Ser. A} 38 (1985), 1--14.

\bibitem{Emms} Emms, D., Severini, S., Wilson, R.C., Hancock, E.R.,
    Coined quantum walks lift the cospectrality of graphs and trees, {\sl Pattern
    Recognition} 42 (2009), 1988--2002.

\bibitem{Etzion2007JCD}
Etzion, T.,
Configuration distribution and designs of codes in the Johnson scheme,
{\sl J. Combin. Des.} 15 (2007), 15--34.


\bibitem{colorJohnson} Etzion, T., Bitan, S., On the chromatic number,
    colorings, and codes of the Johnson graph, {\sl Discrete Appl. Math.} 70
    (1996), 163--175.


\bibitem{FII} Faradjev, I.A., Ivanov, A.A., Ivanov, A.V., Distance-transitive
    graphs of valency 5, 6 and 7, {\sl European J. Combin.} 7 (1986),
    303--319.



\bibitem{FKM94} Farad\v{z}ev, I.A., Klin, M.H.,
    Muzichuk, M.E.,
    Cellular rings and groups of automorphisms of graphs,
    {\sl Investigations in Algebraic Theory of Combinatorial
    Objects} (I.A. Farad\v{z}ev, A.A. Ivanov, M.H. Klin,
    A.J. Woldar, eds.), Kluwer Academic Publishers, Dordrecht, 1994,
    pp.~1--153.

\bibitem{FLV2013pre}
Fazeli, A., Lovett, S., Vardy, A.,
Nontrivial $t$-designs over finite fields exist for all $t$,
{\sl J. Combin. Theory Ser. A} 127 (2014), 149--160;
\arxiv{1306.2088}.

\bibitem{fue} Feige, U., A tight lower bound on the cover time for random walks
    on graphs, {\sl Random Struct. Algorithms} 6 (1995), 433--438.

\bibitem{FLWfractionalmetric} Feng, M., Lv, B., Wang, K., On the fractional metric dimension of graphs,  {\sl
    Discrete Appl. Math.} 170 (2014), 55--63;
\arxiv{1112.2106}.

\bibitem{FengWang} Feng, M., Wang, K., On the metric dimension of bilinear
    forms graphs, {\sl Discrete Math.} 312 (2012), 1266--1268;
    \arxiv{1104.4089}.

\bibitem{FMX2014pre}
%Feng, T., Momihara, K., Xiang, Q.,
%Cameron-Liebler line classes with parameter $x=\frac{q^2-1}{2}$, preprint (2014);
Feng, T., Momihara, K., Xiang, Q.,
Cameron-Liebler line classes with parameter $x=\frac{q^2-1}{2}$,
{\sl J. Combin. Theory Ser. A} 133 (2015), 307--338;
\arxiv{1406.6526}.

\bibitem{F97} % MR1479756 (98j:05098)
Fiol, M.A., An eigenvalue characterization of antipodal distance-regular
graphs, {\sl Electron. J. Combin.} 4:1 (1997), R30.

\bibitem{F00}
Fiol, M.A.,
A quasi-spectral characterization of strongly distance-regular graphs,
{\sl Electron. J. Combin.} 7 (2000), R51.

\bibitem{Fiol2001CPC}
Fiol, M.A.,
Some spectral characterizations of strongly distance-regular graphs,
{\sl Combin. Probab. Comput.} 10 (2001), 127--135.

\bibitem{Fi02} % MR1887483 (2003d:05179)
Fiol, M.A., Algebraic characterizations of distance-regular graphs,
{\sl Discrete Math.} 246 (2002), 111--129.

\bibitem{Fi05} % MR2116448 (2006b:05128)
Fiol, M.A., Spectral bounds and distance-regularity, {\sl Linear Algebra Appl.}
397 (2005), 17--33.

\bibitem{Fiol2014pre}
Fiol, M.A.,
A spectral characterization of strongly distance-regular graphs with diameter four,
preprint (2014);
\arxiv{1407.1392}.

\bibitem{Fiolexcess} Fiol, M.A., Gago, S., Garriga, E.,
    A simple proof of the spectral excess theorem for
    distance-regular graphs, {\sl Linear Algebra Appl.}
    432 (2010), 2418--2422.

\bibitem{FG97} % MR1483473 (99c:05132)
Fiol, M.A., Garriga, E., From local adjacency polynomials to locally
pseudo-distance-regular graphs, {\sl J. Combin. Theory Ser. B} 71 (1997),
162--183.

\bibitem{FG1999LAA}
Fiol, M.A., Garriga, E.,
On the algebraic theory of pseudo-distance-regularity around a set,
{\sl Linear Algebra Appl.} 298 (1999), 115--141.

\bibitem{FG2001SIAM}
Fiol, M.A., Garriga, E.,
An algebraic characterization of completely regular codes in distance-regular graphs,
{\sl SIAM J. Discrete Math.} 15 (2001/02), 1--13.

\bibitem{FHY96} % MR1417795 (97j:05064)
Fiol, M.A., Garriga, E., Yebra, J.L.A., Locally pseudo-distance-regular graphs,
{\sl J. Combin. Theory Ser. B} 68 (1996), 179--205.

\bibitem{FDF193} Fon-Der-Flaass, D.G., There exists no
    distance-regular graph with intersection array
    $(5,4,3;1,1,2)$, {\sl European J. Combin.} 14 (1993), 409--412.

\bibitem{FDF293} Fon-Der-Flaass, D.G., A distance-regular
    graph with intersection array $(5,4,3,3; \break 1,1,1,2)$ does not
    exist, {\sl J. Algebraic Combin.} 2 (1993), 49--56.


\bibitem{FonDerFlaassprolific} Fon-Der-Flaass, D.G., New
    prolific
    constructions of strongly regular graphs, {\sl Adv. Geom.}
    2 (2002), 301--306.

\bibitem{FonDerFlaass2007SMJ}
Fon-Der-Flaass, D.G.,
Perfect $2$-colorings of a hypercube,
{\sl Siberian Math. J.} 48 (2007), 740--745.

\bibitem{Fuglister} Fuglister, F.J., On generalized Moore geometries I, II, {\sl Discrete Math.} 67 (1987), 249--258, 259--269.

\bibitem{FKT07}
Fujisaki, T., Koolen, J.H., Tagami, M., Some properties of the twisted
Grassmann graphs, {\sl Innov. Incidence Geom.} 3 (2006), 81--87.

\bibitem{Funk-Neubauer2009LAA}
Funk-Neubauer, D.,
Tridiagonal pairs and the $q$-tetrahedron algebra,
{\sl Linear Algebra Appl.} 431 (2009), 903--925;
\arxiv{0806.0901}.

\bibitem{GGZF08} Gao, S., Guo, J., Zhang, B., Fu, L.,
    Subspaces in $d$-bounded distance-regular graphs and their
    applications, {\sl European J. Combin.} 29 (2008), 592--600.

\bibitem{G74} Gardiner, A., Antipodal covering graphs, {\sl J. Combin. Theory
   Ser. B} 16 (1974), 255--273.


\bibitem{GavElec10} Gavrilyuk, A.L., On the Koolen-Park inequality and
    Terwilliger graphs, {\sl Electron. J. Combin.} 17 (2010), R125;
    \arxiv{1007.3339}.


\bibitem{Gav11} Gavrilyuk, A.L., Distance-regular graphs with intersection
    arrays $\{55, 36, 11; \break 1, 4, 45\}$ and $\{56, 36, 9; 1, 3, 48\}$ do not exist, {\sl
    Dokl. Math.} 84 (2011), 444--446.

\bibitem{GK2012pre}
Gavrilyuk, A.L., Koolen, J.H., The Terwilliger polynomial of a
$Q$-polynomial distance-regular graph and its application to
pseudo-partition graphs, {\sl Linear Algebra Appl.} 466 (2015),
117--140;
\arxiv{1403.4027}.


\bibitem{GKbilinear15}
Gavrilyuk, A.L., Koolen, J.H., The characterization of the graphs
of bilinear $(d \times d)$-forms over $\mathbb{F}_2$, preprint
(2015);
\arxiv{1511.09435}.



\bibitem{GavMak2005} Gavrilyuk, A.L., Makhnev, A.A., On Krein graphs without triangles, {\sl Dokl. Math.} 72 (2005), 591--594.

\bibitem{GavMak2011} Gavrilyuk, A.L., Makhnev, A.A., On Terwilliger graphs in
    which the neighborhood of each vertex is isomorphic to the
    Hoffman--Singleton graph, {\sl Mathematical Notes} 89 (2011),
    633--644.

\bibitem{GavMakpre} Gavrilyuk, A.L., Makhnev, A.A., Distance-regular graphs
    with intersection arrays $\{52,35,16;1,4,28\}$ and $\{69,48,24;1,4,46\}$ do not exist, {\sl Des. Codes
    Cryptogr.} 65 (2012), 49--54.

\bibitem{GavMak2011T} Gavrilyuk, A.L., Makhnev, A.A., Distance-regular graph
    with the intersection array $\{45, 30, 7; 1, 2, 27\}$ does not exist, {\sl Discrete Math. Appl.} 23 (2013), 225--244.

\bibitem{GM2014JCTA}
Gavrilyuk, A.L., Metsch, K.,
A modular equality for Cameron--Liebler line classes,
{\sl J. Combin. Theory Ser. A} 127 (2014), 224--242.

\bibitem{GM2012pre}
Gavrilyuk, A.L., Mogilnykh, I.Y.,
Cameron-Liebler line classes in $PG(n,4)$,
{\sl Des. Codes Cryptogr.} 73 (2014), 969--982;
\arxiv{1205.2351}.

\bibitem{GVZ2014SIGMA}
Genest, V.X., Vinet, L., Zhedanov, A.,
A ``continuous'' limit of the complementary Bannai--Ito polynomials: Chihara polynomials,
{\sl SIGMA Symmetry Integrability Geom. Methods Appl.} 10 (2014), Paper 038;
\arxiv{1309.7235}.

\bibitem{Gijswijt2005PhD}
Gijswijt, D.,
{\sl Matrix algebras and semidefinite programming techniques for codes},
thesis,
University of Amsterdam, 2005;
\arxiv{1007.0906}.

\bibitem{GST2006JCTA} Gijswijt, D., Schrijver, A., Tanaka, H., New upper bounds
    for nonbinary codes based on the Terwilliger algebra and semidefinite
    programming, {\sl J. Combin. Theory Ser. A} 113 (2006), 1719--1731.

\bibitem{gillespiethesis}
Gillespie, N.I.,
{\sl Neighbour transitivity on codes in Hamming graphs},
thesis,
The University of Western Australia, 2011.

\bibitem{Gillespie2013DM}
Gillespie, N.I.,
A note on binary completely regular codes with large minimum distance,
{\sl Discrete Math.} 313 (2013), 1532--1534;
\arxiv{1210.6459}.

\bibitem{GGP2012pre}
Gillespie, N.I., Giudici, M., Praeger, C.E.,
Classification of a family of completely transitive codes, preprint (2012);
\arxiv{1208.0393}.

\bibitem{GP2013JCTA}
Gillespie, N.I., Praeger, C.E.,
Uniqueness of certain completely regular Hadamard codes,
{\sl J. Combin. Theory Ser. A} 120 (2013), 1394--1400;
\arxiv{1112.1247}.

\bibitem{GP2013DCC}
Gillespie, N.I., Praeger, C.E.,
Neighbour transitivity on codes in Hamming graphs,
{\sl Des. Codes Cryptogr.} 67 (2013), 385--393;
\arxiv{1112.1244}.

\bibitem{GP2012-4pre}
Gillespie, N.I., Praeger, C.E.,
Diagonally neighbour transitive codes and frequency
    permutation arrays, {\sl J. Algebraic Combin.} 39 (2014), 733--747;
%From neighbour transitive codes to frequency permutation arrays,
%preprint (2012);
\arxiv{1204.2900}.

\bibitem{GP2012-5pre}
Gillespie, N.I., Praeger, C.E.,
Complete transitivity of the Nordstrom-Robinson codes,
preprint (2012);
\arxiv{1205.3878}.

\bibitem{GuPr99}
Giudici, M., Praeger, C.E.,
Completely transitive codes in Hamming graphs,
{\sl European J. Combin.} 20 (1999), 647--662.

\bibitem{Go2002EJC}
Go, J.T.,
The Terwilliger algebra of the hypercube,
{\sl European J. Combin.} 23 (2002), 399--429.

\bibitem{GT2002EJC} Go, J.T., Terwilliger, P., Tight distance-regular graphs
    and the subconstituent algebra, {\sl European J. Combin.} 23 (2002),
    793--816.

\bibitem{God88} Godsil, C.D., Bounding the diameter of distance-regular
    graphs, {\sl Combinatorica} 8 (1988), 333--343.

\bibitem{Godsil1992AJC}
Godsil, C.D.,
Krein covers of complete graphs,
{\sl Australas. J. Combin.} 6 (1992), 245--255.

\bibitem{Godsilac} Godsil, C.D., {\sl Algebraic Combinatorics},
Chapman \& Hall, New York, 1993.


\bibitem{Godsil93} Godsil, C.D., Geometric distance-regular
    covers, {\sl New Zealand J. Math.} 22 (1993),
    31--38.

\bibitem{Godsil96} Godsil, C.D., Covers of complete graphs,
{\sl Progress in Algebraic Combinatorics} (E. Bannai, A. Munemasa, eds.),
Advanced Studies in Pure Mathematics, vol.~24,
Mathematical Society of Japan, Tokyo, 1996, pp.~137--163.

\bibitem{G98} % MR1638611 (99h:05128)
Godsil, C.D., Eigenpolytopes of distance regular graphs, {\sl Canad. J. Math.}
50 (1998), 739--755.

\bibitem{Godsilperiodic} Godsil, C., Periodic graphs, {\sl Electron. J.
    Combin.} 18:1 (2011), P23;
    \arxiv{0806.2074}.

\bibitem{GodsilHensel92} Godsil, C.D., Hensel, A.D.,
    Distance regular covers of the complete graph, {\sl J. Combin. Theory Ser. B} 56 (1992), 205--238.

\bibitem{GoKo95} Godsil, C.D., Koolen, J.H., On the
    multiplicity of eigenvalues of distance-regular graphs,
    {\sl Linear Algebra Appl.} 226-228 (1995), 273--275.

\bibitem{GLP98} % MR1630564 (99e:05130)
Godsil, C.D., Liebler, R.A., Praeger, C.E., Antipodal distance transitive
covers of complete graphs, {\sl European J. Combin.} 19 (1998),
455--478.

\bibitem{gmk} Godsil, C.D., McKay, B.D., Feasibility
    conditions for the existence of walk-regular graphs, {\sl
    Linear Algebra Appl.} 30 (1980), 51--61.

\bibitem{GM2016B}
Godsil, C., Meagher, K.,
{\sl Erd\H{o}s--Ko--Rado Theorems: Algebraic Approaches},
Cambridge University Press, Cambridge, 2016.

\bibitem{GP1997pre}
Godsil, C.D., Praeger, C.E.,
Completely transitive designs,
manuscript (1997);
\arxiv{1405.2176}.

\bibitem{GodsilRoy08} Godsil, C., Roy, A., Two
    characterizations of crooked functions, {\sl IEEE Trans. Inform. Theory} 54 (2008), 864--866;
    \arxiv{0704.1293}.

\bibitem{GR2011AC}
Godsil, C., Royle, G.F.,
Cores of geometric graphs,
{\sl Ann. Comb.} 15 (2011), 267--276;
\arxiv{0806.1300}.

\bibitem{GSbiregular} Godsil, C.D., Shawe-Taylor, J., Distance-reguralised
    graphs are distance-regular or distance-biregular, {\sl J. Combin. Theory Ser. B} 43
    (1987), 14--24.

\bibitem{GR1999C}
Goemans, M.X., Rendl, F.,
Semidefinite programs and association schemes,
{\sl Computing} 63 (1999), 331--340.

\bibitem{GWL13} Guo, J., Wang, K., Li, F., Metric dimension of some distance-regular graphs, {\sl J. Comb. Optim.} 26 (2013), 190--197;
\arxiv{1105.1847}.


\bibitem{GWL13DP} Guo, J., Wang, K., Li, F., Metric dimension of symplectic dual polar graphs and symmetric bilinear
    forms graphs, {\sl Discrete Math.} 313 (2013), 186--188.

\bibitem{GM2013} Guo, W., Makhnev, A.A., On distance-regular graphs without 4-claws, {\sl
    Dokl. Math.} 88 (2013), 625--629.


\bibitem{Haemersthesis} Haemers, W.H., {\sl Eigenvalue techniques in design and
    graph theory}, thesis,
Eindhoven University of Technology, 1979;
\url{http://alexandria.tue.nl/extra3/proefschrift/PRF3A/7909413.pdf}.


\bibitem{HaeInterlacing} Haemers, W.H., Interlacing eigenvalues and graphs,
    {\sl Linear Algebra
    Appl.} 226-228 (1995), 593--616.




\bibitem{Ha96} % MR1375618 (97e:05144)
Haemers, W.H., Distance-regularity and the spectrum of graphs, {\sl Linear
Algebra Appl.} 236 (1996), 265--278.

\bibitem{HS95} % MR1374473 (96k:05132)
Haemers, W.H., Spence, E., Graphs cospectral with distance-regular graphs, {\sl
Linear Multilinear Algebra} 39 (1995), 91--107.

\bibitem{injectivecolor} Hahn, G., Kratochv\'{\i}l, J., \v{S}ir\'{a}\v{n}, J.,
    Sotteau, D., On the injective chromatic number of graphs, {\sl Discrete Math.} 256 (2002),
    179--192.

\bibitem{Hanaki2000JA}
Hanaki, A.,
Semisimplicity of adjacency algebras of association schemes,
{\sl J. Algebra} 225 (2000), 124--129.

\bibitem{Hanaki2002AM}
Hanaki, A.,
Locality of a modular adjacency algebra of an association scheme of prime power order,
{\sl Arch. Math. (Basel)} 79 (2002), 167--170.

\bibitem{Hanaki2009EJC}
Hanaki, A.,
Representations of finite association schemes,
{\sl European J. Combin.} 30 (2009), 1477--1496.

\bibitem{HY2005JAC}
Hanaki, A., Yoshikawa, M.,
On modular standard modules of association schemes,
{\sl J. Algebraic Combin.} 21 (2005), 269--279.

\bibitem{Hartwig2007LAA}
Hartwig, B.,
The tetrahedron algebra and its finite-dimensional irreducible modules,
{\sl Linear Algebra Appl.} 422 (2007), 219--235;
\arxiv{math/0606197}.

\bibitem{Hashimoto2001IDAQPRT}
Hashimoto, Y.,
Quantum decomposition in discrete groups and interacting Fock spaces,
{\sl Infin. Dimens. Anal. Quantum Probab. Relat. Top.} 4 (2001), 277--287.

\bibitem{HHO2003JMP}
Hashimoto, Y., Hora, A., Obata, N.,
Central limit theorems for large graphs: method of quantum decomposition,
{\sl J. Math. Phys.} 44 (2003), 71--88.

\bibitem{HOT2001P}
Hashimoto, Y., Obata, N., Tabei, N.,
A quantum aspect of asymptotic spectral analysis of large Hamming graphs,
{\sl Quantum Information III} (T. Hida, K. Sait\^{o}, eds.),
World Scientific Publishing, River Edge, NJ, 2001, pp.~45--57.

\bibitem{HI2012pre}
%Hattai, T., Ito, T.,
%On a certain subalgebra of $U_q(\widehat{\mathfrak{sl}}_2)$ related to the degenerate $q$-Onsager algebra,
%preprint (2012);
Hattai, T., Ito, T.,
On a certain subalgebra of $U_q(\widehat{\mathfrak{sl}}_2)$ related to the degenerate $q$-Onsager algebra,
{\sl SIGMA Symmetry Integrability Geom. Methods Appl.} 11 (2015), Paper 007;
\arxiv{1205.2946}.

\bibitem{Hemmeter1984UM}
Hemmeter, J.,
Halved graphs, Johnson and Hamming graphs,
{\sl Utilitas Math.} 25 (1984), 115--118.

\bibitem{Hemmeter1986EJC}
Hemmeter, J.,
Distance-regular graphs and halved graphs,
{\sl European J. Combin.} 7 (1986), 119--129.

\bibitem{Hemmeter1988EJC}
Hemmeter, J.,
The large cliques in the graph of quadratic forms,
{\sl European J. Combin.} 9 (1988), 395--410.

\bibitem{HW1990EJCa}
Hemmeter, J., Woldar, A.,
On the maximal cliques of the quadratic forms graph in even characteristic,
{\sl European J. Combin.} 11 (1990), 119--126.

\bibitem{HW1990EJCb}
Hemmeter, J., Woldar, A.,
Classification of the maximal cliques of size $\geq q+4$ in the quadratic forms graph in odd characteristic,
{\sl European J. Combin.} 11 (1990), 433--449.

\bibitem{HW1999EJC}
Hemmeter, J., Woldar, A.,
The complete list of maximal cliques of $\mathrm{Quad}(n,q)$, $q$ even,
{\sl European J. Combin.} 20 (1999), 81--85.

\bibitem{hilanomura} Hilano, T., Nomura, K., Distance
    degree
    regular graphs, {\sl J. Combin. Theory Ser. B} 37
    (1984), 96--100.

\bibitem{Hi94} % MR1275259 (95b:05215)
Hiraki, A., An improvement of the Boshier-Nomura bound, {\sl J. Combin. Theory
Ser. B} 61 (1994), 1--4.

\bibitem{Hi95} % MR1356849 (96j:05118)
Hiraki, A., Distance-regular subgraphs in a distance-regular graph, I, II, {\sl
European J. Combin.} 16 (1995), 589--602, 603--615.

\bibitem{H196} % MR1407370 (97i:05136)
Hiraki, A., Distance-regular subgraphs in a distance-regular graph, III, {\sl
European J. Combin.} 17 (1996), 629--636.

\bibitem{H97} % MR1468334 (98m:05201)
Hiraki, A., Distance-regular subgraphs in a distance-regular graph, IV, {\sl
European J. Combin.} 18 (1997), 635--645.

\bibitem{Hi198} Hiraki, A., Distance-regular subgraphs in a
    distance-regular graph, V, {\sl European J. Combin.} 19
    (1998), 141--150.

\bibitem{Hi98} % MR1657939 (2000c:05156)
Hiraki, A., Distance-regular subgraphs in a distance-regular graph, VI, {\sl
European J. Combin.} 19 (1998), 953--965.

\bibitem{Hi299} % MR1735089 (2000k:05266)
Hiraki, A., Distance-regular graphs of the height $h$, {\sl Graphs Combin.} 15 (1999), 417--428.

\bibitem{Hi499} Hiraki, A., Strongly closed subgraphs in a
    regular thick near polygon, {\sl European J. Combin.} 20
    (1999), 789--796.

\bibitem{Hi01} % MR1867229 (2002j:05153)
Hiraki, A., A distance-regular graph with strongly closed subgraphs, {\sl J.
Algebraic Combin.} 14 (2001), 127--131.

\bibitem{Hi03D} Hiraki, A., A characterization of the doubled Grassmann graphs,
    the doubled Odd graphs, and the Odd graphs by strongly closed subgraphs,
    {\sl European J. Combin.} 24 (2003), 161--171.

\bibitem{Hi303} % MR1975940 (2004f:05194)
Hiraki, A., A distance-regular graph with bipartite geodetically closed
subgraphs, {\sl European J. Combin.} 24 (2003), 349--363.

\bibitem{Hi103} % MR2007899 (2004h:05133)
Hiraki, A., The number of columns $(1,k-2,1)$ in the intersection array of a
distance-regular graph, {\sl Graphs Combin.} 19 (2003), 371--387.

\bibitem{Hi07} % MR2261815 (2007j:05223)
Hiraki, A., A characterization of the odd graphs and the doubled odd graphs
with a few of their intersection numbers, {\sl European J. Combin.} 28 (2007), 246--257.

\bibitem{Hiraki08b} Hiraki, A., Strongly closed subgraphs in a
    distance-regular graph with $c_2>1$, {\sl Graphs Combin.} 24
    (2008), 537--550.

\bibitem{Hiraki09a} Hiraki, A., Distance-regular graph with
    $c_2>1$ and $a_1=0<a_2$, {\sl Graphs Combin.}
    25 (2009), 65--79.

\bibitem{Hiraki2012GC}
Hiraki, A.,
A characterization of the Hamming graphs and the dual polar graphs by completely regular subgraphs,
{\sl Graphs Combin.} 28 (2012), 449--467.

\bibitem{HK98} % MR1682924 (99m:05171)
Hiraki, A., Koolen, J., An improvement of the Ivanov bound, {\sl Ann. Comb.} 2
(1998), 131--135.

\bibitem{HK02} % MR1923085 (2003j:05132)
Hiraki, A., Koolen, J., An improvement of the Godsil bound, {\sl Ann. Comb.} 6
(2002), 33--44.

\bibitem{HiKo04a} Hiraki, A., Koolen, J., A note on regular
    near polygons, {\sl Graphs Combin.} 20 (2004), 485--497.

\bibitem{HiKo04c} Hiraki, A., Koolen, J., A Higman-Haemers
    inequality for thick regular near polygons, {\sl J. Algebraic
    Combin.} 20 (2004), 213--218.

\bibitem{HiKo04b} Hiraki, A., Koolen, J., The regular near
    polygons of order $(s,2)$, {\sl J. Algebraic Combin.} 20 (2004), 219--235.

\bibitem{HiKo06} Hiraki, A., Koolen, J., A generalization
    of an inequality of Brouwer-Wilbrink, {\sl J. Combin. Theory Ser. A} 109 (2005), 181--188.

\bibitem{HNS} Hiraki, A., Nomura, K., Suzuki, H., Distance-regular graphs of
    valency 6 and $a_1 =1$, {\sl J. Algebraic Combin.} 11 (2000),
    101--134.

\bibitem{HSW95} % MR1365851 (96i:05184)
Hiraki, A., Suzuki, H., Wajima, M., On distance-regular graphs with $k\sb
i=k\sb j$, II, {\sl Graphs Combin.} 11 (1995), 305--317.

\bibitem{HI1998JAC} Hobart, S., Ito, T., The structure of nonthin irreducible
    $T$-modules of endpoint $1$: ladder bases and classical parameters, {\sl J.
    Algebraic Combin.} 7 (1998), 53--75.

\bibitem{hoffman63} Hoffman, A.J., On the polynomial of a
    graph, {\sl Amer. Math. Monthly} 70 (1963), 30--36.

\bibitem{HX2006JAC}
Hollmann, H.D.L., Xiang, Q.,
Association schemes from the action of $\mathrm{PGL}(2,q)$ fixing a nonsingular conic in $\mathrm{PG}(2,q)$,
{\sl J. Algebraic Combin.} 24 (2006), 157--193;
\arxiv{math/0503573}.

\bibitem{Hong} Hong, Y., On the nonexistence of nontrivial perfect $e$-codes
    and tight $2e$-designs in Hamming schemes $H(n,q)$ with $e\geq 3$ and
    $q\geq 3$, {\sl Graphs Combin.} 2 (1986), 145--164.

\bibitem{Hora1998IDAQPRT}
Hora, A.,
Central limit theorems and asymptotic spectral analysis on large graphs,
{\sl Infin. Dimens. Anal. Quantum Probab. Relat. Top.} 1 (1998), 221--246.

\bibitem{Hora2000PTRF}
Hora, A.,
Gibbs state on a distance-regular graph and its application to a scaling limit of the spectral distributions of discrete Laplacians,
{\sl Probab. Theory Related Fields} 118 (2000), 115--130.

\bibitem{Hora00} Hora, A., An axiomatic approach to the cut-off phenomenon
    for random walks on large distance-regular graphs, {\sl Hiroshima Math. J.}
30 (2000), 271--299.

\bibitem{HO2003P}
Hora, A., Obata, N.,
Quantum decomposition and quantum central limit theorem,
{\sl Fundamental Aspects of Quantum Physics} (L. Accardi, S. Tasaki, eds.),
QP--PQ: Quantum Probability and White Noise Analysis, vol.~17,
World Scientific Publishing, River Edge, NJ, 2003, pp.~284--305.

\bibitem{HO2007B}
Hora, A., Obata, N.,
{\sl Quantum Probability and Spectral Analysis of Graphs},
Springer, Berlin, 2007.

\bibitem{HO2008TAMS}
Hora, A., Obata, N.,
Asymptotic spectral analysis of growing regular graphs,
{\sl Trans. Amer. Math. Soc.} 360 (2008), 899--923.

\bibitem{HS2007EJC}
Hosoya, R., Suzuki, H.,
Tight distance-regular graphs with respect to subsets,
{\sl European J. Combin.} 28 (2007), 61--74.

\bibitem{Hua1945} Hua, L., Geometries of matrices. I. Generalizations of Von Staudt's theorem, {\sl Trans. Amer. Math. Soc.} 57 (1945), 441--481.

\bibitem{Huang2012pre}
%Huang, H.,
%Finite-dimensional irreducible modules of the universal Askey-Wilson algebra,
%preprint (2012);
Huang, H.,
Finite-dimensional irreducible modules of the universal Askey-Wilson algebra,
{\sl Comm. Math. Phys.} 340 (2015), 959--984;
\arxiv{1210.1740}.

\bibitem{HLW2014pre}
%Huang, L.-P., Lv, B., Wang, K.,
%The endomorphism of Grassmann graphs,
%preprint (2014);
Huang, L.-P., Lv, B., Wang, K.,
The endomorphisms of Grassmann graphs,
{\sl Ars Math. Contemp.} 10 (2016), 383--392;
\arxiv{1404.7578}.

\bibitem{Huang87} Huang, T., A characterization of the
    association schemes of bilinear forms, {\sl European J. Combin.} 8
    (1987), 159--173.

\bibitem{HL99} % MR1701762 (2000g:05152)
Huang, T., Liu, C., Spectral characterization of some generalized odd graphs,
{\sl Graphs Combin.} 15 (1999), 195--209.

\bibitem{HPW2009pre}
Huang, Y., Pan, Y., Weng, C.,
%$D$-bounded property in a distance-regular graph with $a_1=0$ and $a_2\ne 0$,
%preprint (2009).
Nonexistence of a class of distance-regular graphs,
{\sl Electron. J. Combin.} 22:2 (2015), P2.37.

\bibitem{IO2006P}
Igarashi, D., Obata, N.,
Asymptotic spectral analysis of growing graphs: odd graphs and spidernets,
{\sl Quantum Probability} (M. Bo\.{z}ejko, W. M{\l}otkowski, J. Wysocza\'{n}ski, eds.),
Banach Center Publications, vol.~73,
Polish Academy of Sciences, Institute of Mathematics, Warsaw, 2006,
pp.~245--265.

\bibitem{IM2013DCC}
Ihringer, F., Metsch, K.,
On the maximum size of Erd\H{o}s--Ko--Rado sets in $H(2d+1,q^2)$,
{\sl Des. Codes Cryptogr.} 72 (2014), 311--316.

\bibitem{symmetricdesigns} Ionin, Y.J., Shrikhande, M.S., {\sl Combinatorics
    of Symmetric Designs}, Cambridge University Press, Cambridge, 2006.

\bibitem{INT2011LAA} Ito, T., Nomura, K., Terwilliger, P., A classification of
    sharp tridiagonal pairs, {\sl Linear Algebra Appl.} 435 (2011), 1857--1884;
    \arxiv{1001.1812}.

\bibitem{IS2014LAA}
Ito, T., Sato, J.,
TD-pairs of type II with shape $1,2,\dots,2,1$,
{\sl Linear Algebra Appl.} 461 (2014), 51--91.

\bibitem{ITT2001P} Ito, T., Tanabe, K., Terwilliger, P., Some algebra related
    to $P$- and $Q$-polynomial association schemes, {\sl Codes and Association Schemes}
    (A. Barg, S. Litsyn, eds.), American Mathematical Society,
    Providence, RI, 2001, pp.~167--192;
    \arxiv{math/0406556}.

\bibitem{IT2004JPAA}
Ito, T., Terwilliger, P.,
The shape of a tridiagonal pair,
{\sl J. Pure Appl. Algebra} 188 (2004), 145--160;
\arxiv{math/0304244}.

\bibitem{IT2007JAA}
Ito, T., Terwilliger, P.,
Two non-nilpotent linear transformations that satisfy the cubic $q$-Serre relations,
{\sl J. Algebra Appl.} 6 (2007), 477--503;
\arxiv{math/0508398}.

\bibitem{IT2007CA}
Ito, T., Terwilliger, P.,
The $q$-tetrahedron algebra and its finite dimensional irreducible modules,
{\sl Comm. Algebra} 35 (2007), 3415--3439;
\arxiv{math/0602199}.

\bibitem{IT2007LAA}
Ito, T., Terwilliger, P.,
Tridiagonal pairs of Krawtchouk type,
{\sl Linear Algebra Appl.} 427 (2007), 218--233;
\arxiv{0706.1065}.

\bibitem{IT2009EJC}
Ito, T., Terwilliger, P.,
Distance-regular graphs and the $q$-tetrahedron algebra,
{\sl European J. Combin.} 30 (2009), 682--697;
\arxiv{math/0608694}.

\bibitem{IT2009MMJ}
Ito, T., Terwilliger, P.,
Distance-regular graphs of $q$-Racah type and the $q$-tetrahedron algebra,
{\sl Michigan Math. J.} 58 (2009), 241--254;
\arxiv{0708.1992}.

\bibitem{IT2009JCISS}
Ito, T., Terwilliger, P.,
The Drinfel'd polynomial of a tridiagonal pair,
{\sl J. Comb. Inf. Syst. Sci.} 34 (2009), 255--292;
\arxiv{0805.1465}.

\bibitem{IT2009JA}
Ito, T., Terwilliger, P.,
Tridiagonal pairs of $q$-Racah type,
{\sl J. Algebra} 322 (2009), 68--93;
\arxiv{0807.0271}.

\bibitem{IT2010KJM} Ito, T., Terwilliger, P., The augmented tridiagonal
    algebra, {\sl Kyushu J. Math.} 64 (2010), 81--144;
    \arxiv{0904.2889}.

\bibitem{Iv83}
Ivanov, A.A.,
Bounding the diameter of a distance-regular graph,
{\sl Dokl. Akad. Nauk SSSR} 271 (1983), 789--792.

\bibitem{IvanovDTG} Ivanov, A.A., Distance-transitive graphs and their
    classification, {\sl Investigations in Algebraic Theory of Combinatorial
    Objects} (I.A. Farad\v{z}ev, A.A. Ivanov, M.H. Klin,
    A.J. Woldar, eds.), Kluwer Academic Publishers, Dordrecht, 1994,
    pp.~283--378.

\bibitem{ILPP97} Ivanov, A.A., Liebler, R.A., Penttila, T., Praeger, C.E.,
    Antipodal distance-transitive covers of complete bipartite graphs, {\sl European J. Combin.} 18 (1997), 11--33.

\bibitem{IMU1989EJC}
Ivanov, A.A., Muzichuk, M.E., Ustimenko, V.A.,
On a new family of ($P$ and $Q$)-polynomial schemes,
{\sl European J. Combin.} 10 (1989), 337--345.

\bibitem{IvaShp90} Ivanov, A.A., Shpectorov, S.V., The $P$-geometry for
    $M_{23}$ has no non-trivial 2-coverings, {\sl European J. Combin.} 11 (1990), 373--379.

\bibitem{IS1991JMSJ} Ivanov, A.A., Shpectorov, S.V., A characterization of the
    association schemes of Hermitian forms, {\sl J. Math. Soc. Japan} 43
    (1991), 25--48.

\bibitem{Jaeger1996P}
Jaeger, F.,
Towards a classification of spin models in terms of association schemes,
{\sl Progress in Algebraic Combinatorics} (E. Bannai, A. Munemasa, eds.),
Advanced Studies in Pure Mathematics, vol.~24,
Mathematical Society of Japan, Tokyo, 1996, pp.~197--225.

\bibitem{JMN1998JAC}
Jaeger, F., Matsumoto, M., Nomura, K.,
Bose-Mesner algebras related to type II matrices and spin models,
{\sl J. Algebraic Combin.} 8 (1998), 39--72.

\bibitem{JaSa06} Jafarizadeh, M.A., Salimi, S., Investigation
    of continuous-time quantum walk via modules of Bose-Mesner and
    Terwilliger algebras, {\sl J. Phys. A} 39 (2006),
    13295--13323;
\arxiv{quant-ph/0603139}.

\bibitem{JaSu08} Jafarizadeh, M.A., Sufiani, R., Perfect state
    transfer over distance-regular spin networks, {\sl Phys. Rev. A} 77 (2008), 022315;
\arxiv{0709.0755}.



\bibitem{JaSuJa07} Jafarizadeh, M.A., Sufiani, R., Jafarizadeh,
    S., Calculating two-point resistances in distance-regular
    resistor networks, {\sl J. Phys. A} 40 (2007), 4949--4972;
\arxiv{cond-mat/0611683}.

\bibitem{JaSuJa09} Jafarizadeh, M.A., Sufiani, R., Jafarizadeh,
    S., Recursive calculation of effective resistances in distance-regular networks
based on Bose-Mesner algebra and Christoffel-Darboux identity, {\sl J. Math.
Phys.} 50 (2009), 023302;
\arxiv{0705.2480}.

\bibitem{Jones1989PJM}
Jones, V.F.R.,
On knot invariants related to some statistical mechanical models,
{\sl Pacific J. Math.} 137 (1989), 311--334.

\bibitem{JuTo09} Jungnickel, D., Tonchev, V.D., Polarities,
    quasi-symmetric designs and Hamada's conjecture, {\sl Des.
    Codes Cryptogr.} 51 (2009), 131--140.


\bibitem{Jurisic2003DM}
Juri\v{s}i\'{c}, A.,
AT4 family and $2$-homogeneous graphs,
{\sl Discrete Math.} 264 (2003), 127--148.

\bibitem{JuKo00DCC} Juri\v{s}i\'{c}, A., Koolen, J.H.,  A local approach to
    $1$-homogeneous graphs, {\sl Des. Codes
    Cryptogr.} 21 (2000), 127--147.

\bibitem{JuKo00EuJC} Juri\v{s}i\'{c}, A., Koolen, J.H., Nonexistence of some
    antipodal distance-regular graphs of diameter four, {\sl European J.
    Combin.} 21 (2000), 1039--1046.

\bibitem{JK2002DM} Juri\v{s}i\'{c}, A., Koolen, J.H., Krein parameters and
    antipodal tight graphs with diameter $3$ and $4$, {\sl Discrete Math.} 244
    (2002), 181--202.

\bibitem{JK2003JAC}
Juri\v{s}i\'{c}, A., Koolen, J.H.,
$1$-Homogeneous graphs with cocktail party $\mu$-graphs,
{\sl J. Algebraic Combin.} 18 (2003), 79--98.

\bibitem{JuKo07JAC} Juri\v{s}i\'{c}, A., Koolen, J.H., Distance-regular graphs
    with complete multipartite $\mu$-graphs and AT4 family, {\sl J. Algebraic
    Combin.} 25 (2007), 459--471.

\bibitem{JuKo11} Juri\v si\'c, A., Koolen,  J.H., Classification of the family
    $\mathrm{AT}4(qs,q,q)$ of antipodal tight graphs, {\sl J. Combin. Theory Ser. A}
    118 (2011), 842--852.

\bibitem{JuKopre} Juri\v{s}i\'{c}, A., Koolen, J.H., The uniqueness of two
    antipodal covers of diameter $4$, in preparation.

\bibitem{JKM2005JCTB}
Juri\v{s}i\'{c}, A., Koolen, J.H., Miklavi\v{c}, \v{S}.,
Triangle- and pentagon-free distance-regular graphs with an eigenvalue multiplicity equal to the valency,
{\sl J. Combin. Theory Ser. B} 94 (2005), 245--258.

\bibitem{JKT2000JAC} Juri\v{s}i\'{c}, A., Koolen, J.H., Terwilliger, P., Tight
    distance-regular graphs, {\sl J. Algebraic Combin.} 12 (2000), 163--197;
    \arxiv{math/0108196}.

\bibitem{JKZ2008EJC}
Juri\v{s}i\'{c}, A., Koolen, J.H., \v{Z}itnik, A.,
Triangle-free distance-regular graphs with an eigenvalue multiplicity equal to their valency and diameter $3$,
{\sl European J. Combin.} 29 (2008), 193--207.

\bibitem{JuMuTa10} Juri\v{s}i\'{c}, A., Munemasa, A., Tagami, Y.,  On graphs
    with complete multipartite $\mu$-graphs, {\sl Discrete Math.} 310 (2010), 1812--1819.

\bibitem{JT2008JAC}
Juri\v{s}i\'{c}, A., Terwilliger, P.,
Pseudo $1$-homogeneous distance-regular graphs,
{\sl J. Algebraic Combin.} 28 (2008), 509--529.

\bibitem{JTZ2010JCTB} Juri\v{s}i\'{c}, A., Terwilliger, P., \v{Z}itnik, A., The
    $Q$-polynomial idempotents of a distance-regular graph, {\sl J. Combin.
    Theory Ser. B} 100 (2010), 683--690;
    \arxiv{0908.4098}.

\bibitem{JTZ2010EJC} Juri\v{s}i\'{c}, A., Terwilliger, P., \v{Z}itnik, A.,
    Distance-regular graphs with light tails, {\sl European J. Combin.} 31
    (2010), 1539--1552.

\bibitem{JurVidpre} Juri\v{s}i\'{c}, A., Vidali, J., Extremal $1$-codes in
    distance-regular graphs of diameter $3$, {\sl Des. Codes
    Cryptogr.} 65 (2012), 29--47.

\bibitem{JwoTu} Jwo, J.-S., Tuan, T.-C., On transmitting delay in
    a distance-transitive strongly antipodal graph, {\sl Inform. Process. Lett.} 51 (1994), 233--235.

\bibitem{Keevash2014pre}
Keevash, P.,
The existence of designs,
preprint (2014);
\arxiv{1401.3665}.

\bibitem{Kempe03} Kempe, J., Quantum random walks: An introductory
    overview, {\sl Contemporary Physics} 44 (2003), 307--327;
    \arxiv{quant-ph/0303081}.

\bibitem{Kempe} Kempe, J., Discrete quantum walks hit exponentially
    faster, {\sl Probab. Theory Related Fields} 133 (2005), 215--235;
    \arxiv{quant-ph/0205083}.

\bibitem{Kim2009EJC}
Kim, J.,
Some matrices associated with the split decomposition for a $Q$-polynomial distance-regular graph,
{\sl European J. Combin.} 30 (2009), 96--113;
\arxiv{0710.4383}.

\bibitem{Kim2010DM}
Kim, J.,
A duality between pairs of split decompositions for a $Q$-polynomial distance-regular graph,
{\sl Discrete Math.} 310 (2010), 1828--1834;
\arxiv{0705.0167}.

\bibitem{kooterwpre} Kim, J., Koolen, J.H., Yu, H., Some notes on Terwilliger graphs, manuscript
    (2012).

\bibitem{KOP2012B} De Klerk, E., De Oliveira Filho, F.M., Pasechnik, D.V.,
    Relaxations of combinatorial problems via association schemes, {\sl
    Handbook on Semidefinite, Conic and Polynomial Optimization} (M.F. Anjos,
    J.B. Lasserre, eds.), Springer, New York, 2012, pp.~171--199.

\bibitem{KPS2008SIAM} De Klerk, E., Pasechnik, D.V., Sotirov, R., On
    semidefinite programming relaxations of the traveling salesman problem,
    {\sl SIAM J. Optim.} 19 (2008), 1559--1573.


\bibitem{Dobre} De Klerk, E., Pasechnik, D., Sotirov, R., Dobre, C., On
    semidefinite programming relaxations of maximum $k$-section, {\sl Math.
    Program. Ser. B} 136 (2012), 253--278.


\bibitem{DKSot10} De Klerk, E., Sotirov, R., Exploiting group symmetry in
    semidefinite programming relaxations of the quadratic assignment problem,
    {\sl Math. Program. Ser. A} 122 (2010), 225--246.

\bibitem{KS2011MPA} De Klerk, E., Sotirov, R., Improved semidefinite
    programming bounds for quadratic assignment problems with suitable
    symmetry, {\sl Math. Program. Ser. A} 133 (2012), 75--91.

\bibitem{KlinPech}
Klin, M., Pech, C.,
A new construction of antipodal distance regular covers of complete graphs through the use of Godsil-Hensel matrices,
{\sl Ars Math. Contemp.} 4 (2011), 205--243.

\bibitem{KLS2010B} Koekoek, R., Lesky, P.A., Swarttouw, R.F., {\sl
    Hypergeometric Orthogonal Polynomials and Their $q$-Analogues},
    Springer-Verlag, Berlin, 2010.

\bibitem{KS1998R} Koekoek, R., Swarttouw, R.F., The Askey scheme of
    hypergeometric orthogonal polynomials and its $q$-analog, report 98-17,
    Delft University of Technology, 1998;
    \url{http://aw.twi.tudelft.nl/~koekoek/askey.html}.

\bibitem{Ko192} Koolen, J.H., On subgraphs in distance-regular graphs,
{\sl J. Algebraic Combin.} 1 (1992), 353--362.

\bibitem{Ko292} Koolen, J.H., A new condition for distance-regular graphs,
{\sl European J. Combin.} 13 (1992), 63--64.

\bibitem{Ko93} Koolen, J.H., On uniformly geodetic graphs, {\sl
    Graphs Combin.} 9 (1993), 325--333.


\bibitem{Koothesis} Koolen, J.H., {\sl Euclidean representations and
    substructures of distance-regular graphs}, thesis, Eindhoven University of Technology, 1994;
    \url{http://alexandria.tue.nl/extra3/proefschrift/PRF10A/9412042.pdf}.

\bibitem{KoolenDoob} Koolen, J.H., A characterization of the Doob graphs, {\sl J. Combin. Theory Ser. B} 65 (1995), 125--138.

\bibitem{Ko95} Koolen, J.H., On a conjecture of Martin on the parameters of
    completely regular codes and the classification of the completely regular
    codes in the Biggs-Smith graph, {\sl Linear Multilinear Algebra} 39 (1995), 3--17.

\bibitem{KoBa10} Koolen, J.H., Bang, S., On distance-regular
    graphs with smallest eigenvalue at least $-m$,  {\sl J. Combin. Theory Ser. B} 100 (2010), 573--584;
    \arxiv{0908.2017}.

\bibitem{KoKiPapre} Koolen, J.H., Kim, J., Park, J., Distance-regular graphs with a relatively small eigenvalue
    multiplicity, {\sl Electron. J. Combin.} 20:1 (2013), P1.



\bibitem{KoLeMa2010}
Koolen, J.H., Lee, W., Martin, W.J.,
Characterizing completely regular codes from an algebraic viewpoint,
{\sl Combinatorics and Graphs} (R.A. Brualdi et al., eds.),
Contemporary Mathematics, vol.~531,
American Mathematical Society, Providence, RI, 2010, pp.~223--242;
\arxiv{0911.1828}.

\bibitem{KoLeMapre09}
Koolen, J.H., Lee, W., Martin, W.J., Tanaka, H.,
Arithmetic completely regular codes,
{\sl Discrete Math. Theor. Comput. Sci.} 17 (2016), 59--76;
\arxiv{0911.1826}.

\bibitem{kmcollection} Koolen, J.H., Markowsky, G.,
%A collection of results concerning simple random walk on
%distance-regular graphs, preprint (2014).
A collection of results concerning electric resistance and simple random walk on distance-regular graphs,
{\sl Discrete Math.} 339 (2016), 737--744.

\bibitem{phi1} Koolen, J.H., Markowsky, G., Park, J., On electric resistances
    for distance-regular graphs, {\sl European J. Combin.} 34 (2013), 770--786;
    \arxiv{1103.2810}.



\bibitem{KooMarpre} Koolen, J.H., Martin, W.J., Distance-regular graphs with
    an eigenvalue with multiplicity 8, manuscript (1994).

\bibitem{KM2000JSPI}
Koolen, J.H., Munemasa, A.,
Tight $2$-designs and perfect $1$-codes in Doob graphs,
{\sl J. Statist. Plann. Inference} 86 (2000), 505--513.

\bibitem{KoPa10} Koolen, J.H., Park, J., Shilla
    distance-regular graphs, {\sl European J. Combin.} 31
    (2010), 2064--2073;
    \arxiv{0902.3860}.

\bibitem{KoPa11} Koolen, J.H., Park, J., Distance-regular graphs with
    $a_1$ or $c_2$ at least half the valency, {\sl J. Combin. Theory Ser. A} 119 (2012), 546--555;
    \arxiv{1008.1209}.
    %(The preprint was called 'Distance-regular graphs with large $a_1$ or $c_2$')

\bibitem{KoPapre} Koolen, J.H., Park, J., A relationship between the diameter
    and the intersection number
$c_2$ for a distance-regular graph, {\sl Des. Codes Cryptogr.} 65 (2012),
55--63;
\arxiv{1109.2195}.

\bibitem{KoPapre12} Koolen, J.H., Park, J., A note on distance-regular graphs with a small number of vertices compared to the valency, {\sl European J. Combin.} 34 (2013), 935--940.

\bibitem{KoPaYu11} Koolen, J.H., Park, J., Yu, H., An inequality involving the
    second largest and smallest eigenvalue  of a distance-regular graph, {\sl
    Linear Algebra Appl.} 434 (2011), 2404--2412.

\bibitem{KQ15} Koolen, J.H., Qiao, Z., Distance-regular graphs with valency $k$ having smallest eigenvalue at most
$-k/2$, preprint (2015);
\arxiv{1507.04839}.


\bibitem{KS94} % MR1273947 (95c:05136)
Koolen, J.H., Shpectorov, S.V., Distance-regular graphs the distance matrix of
which has only one positive eigenvalue, {\sl European J. Combin.} 15 (1994), 269--275.

\bibitem{KoYu11} Koolen, J.H., Yu, H., The distance-regular graphs such that
    all of its second largest local eigenvalues are at most one, {\sl Linear
    Algebra Appl.} 435 (2011), 2507--2519.

\bibitem{Krotov2014pre}
Krotov, D.S.,
Perfect codes in Doob graphs,
%preprint (2014);
Des. Codes Cryptogr., to appear;
\arxiv{1407.6329}.

\bibitem{KuiTon05} Kuijken, E., Tonesi, C.,
    Distance-regular graphs and $(\alpha,\beta)$-geometries,
    {\sl J. Geom.} 82 (2005), 135--145.


\bibitem{Kur2011T} Kurihara, H., An excess theorem for spherical $2$-designs,
    {\sl Des. Codes
    Cryptogr.} 65 (2012), 89--98;
\arxiv{1203.3257}.

\bibitem{KN2012JCTA} Kurihara, H., Nozaki, H., A characterization of
    $Q$-polynomial association schemes, {\sl J. Combin. Theory Ser. A} 119
    (2012), 57--62;
    \arxiv{1007.0473}.

\bibitem{KN2011pre}
Kurihara, H., Nozaki, H.,
A spectral equivalent condition of the $P$-polynomial property for association schemes,
{\sl Electron. J. Combin.} 21:3 (2014), P3.1;
\arxiv{1110.4975}.

\bibitem{LaJwoDh} Lakshmivarahan, S., Jwo, J.-S., Dhall, S.K., Symmetry in
    interconnection networks based on Cayley graphs of permutation groups: A
    survey, {\sl Parallel Comput.} 19 (1993), 361--407.

\bibitem{Lambeck1990D} Lambeck, E.W., {\sl Contributions to the theory of distance regular graphs}, thesis, Eindhoven
    University of Technology, 1990; \url{http://alexandria.tue.nl/extra3/proefschrift/PRF7A/9006771.pdf}.

\bibitem{Lamb93} Lambeck, E., Some elementary inequalities for distance-regular graphs, {\sl European J. Combin.} 14
    (1993), 53.

\bibitem{Lang2002EJC} Lang, M.S., Tails of bipartite distance-regular graphs,
    {\sl European J. Combin.} 23 (2002), 1015--1023.

\bibitem{Lang2003JAC}
Lang, M.S.,
Leaves in representation diagrams of bipartite distance-regular graphs,
{\sl J. Algebraic Combin.} 18 (2003), 245--254.

\bibitem{Lang2004JCTB} Lang, M.S., A new inequality for bipartite
    distance-regular graphs, {\sl J. Combin. Theory Ser. B} 90 (2004), 55--91.

\bibitem{Lang2008EJC}
Lang, M.S.,
Pseudo primitive idempotents and almost $2$-homogeneous bipartite distance-regular graphs,
{\sl European J. Combin.} 29 (2008), 35--44.

\bibitem{LT2007EJC} Lang, M.S., Terwilliger, P.M., Almost-bipartite
    distance-regular graphs with the $Q$-polynomial property, {\sl European J.
    Combin.} 28 (2007), 258--265;
    \arxiv{math/0508435}.

\bibitem{L69} Laskar, R., Eigenvalues of the adjacency matrix
    of the cubic lattice graph, {\sl Pacific J. Math.} 29 (1969),
    623--629.

\bibitem{LMO2010} LeCompte, N., Martin, W.J., Owens, W., On the equivalence
    between real mutually unbiased bases and a certain class of association
    schemes, {\sl European J. Combin.} 31 (2010), 1499--1512.

\bibitem{LeeWeng12} Lee, G.-S., Weng, C.-W., A spectral excess theorem for
    nonregular graphs, {\sl J. Combin. Theory Ser. A} 119 (2012), 1427--1431.

\bibitem{LeeWeng14} Lee, G.-S., Weng, C.-W., A characterization of bipartite distance-regular graphs, {\sl
    Linear Algebra Appl.} 446 (2014), 91--103.

\bibitem{Leespectral} Lee, J., A spectral approach to polyhedral dimension,
    {\sl Math. Program.} 47 (1990), 441--459.

\bibitem{Leedimension} Lee, J., Characterizations of the dimension for classes
    of concordant polytopes, {\sl Math. Oper. Res.} 15 (1990), 139--154.

\bibitem{Lee2013PhD}
Lee, J.-H.,
$Q$-polynomial distance-regular graphs and a double affine Hecke algebra of rank one,
{\sl Linear Algebra Appl.} 439 (2013), 3184--3240;
\arxiv{1307.5297}.

\bibitem{LevineSandpile} Levine, L., Propp, J., What is . . . a sandpile?, {\sl
    Notices Amer. Math. Soc.} 57 (2010), 976--979.


\bibitem{Lewis2000DM} Lewis, H.A., Homotopy in $Q$-polynomial distance-regular
    graphs, {\sl Discrete Math.} 223 (2000), 189--206.

\bibitem{LW97} % MR1483478 (99c:05206)
Liang, Y., Weng, C., Parallelogram-free distance-regular graphs, {\sl J.
Combin. Theory Ser. B} 71 (1997), 231--243.

\bibitem{LP2013pre}
Liebler, R.A., Praeger, C.E.,
Neighbour-transitive codes in Johnson graphs,
{\sl Des. Codes Cryptogr.} 73 (2014), 1--25;
\arxiv{1311.0113}.

\bibitem{Lovasz1979IEEE}
Lov\'{a}sz, L.,
On the Shannon capacity of a graph,
{\sl IEEE Trans. Inform. Theory} 25 (1979), 1--7.

\bibitem{LS1991SIAM}
Lov\'{a}sz, L., Schrijver, A.,
Cones of matrices and set-functions and $0$-$1$ optimization,
{\sl SIAM J. Optim.} 1 (1991), 166--190.

\bibitem{KM2014pre}
Ma, J., Koolen, J.H., Twice $Q$-polynomial distance-regular graphs
of diameter $4$, {\sl Sci. China Math.} 58 (2015), 2683--2690;
\arxiv{1405.2546}.

\bibitem{MaWang5Q} Ma, J., Wang, K., Nonexistence of exceptional $5$-class association schemes with two $Q$-polynomial structures,
{\sl Linear Algebra Appl.} 440 (2014), 278--285;
    \arxiv{1311.5942}.

\bibitem{Ma1994DCC}
Ma, S.L.,
A survey of partial difference sets,
{\sl Des. Codes Cryptogr.} 4 (1994), 221--261.

\bibitem{MacLean2000DM}
MacLean, M.S.,
An inequality involving two eigenvalues of a bipartite distance-regular graph,
{\sl Discrete Math.} 225 (2000), 193--216.

\bibitem{MacLean2003JAC}
MacLean, M.S.,
Taut distance-regular graphs of odd diameter,
{\sl J. Algebraic Combin.} 17 (2003), 125--147.

\bibitem{MacLean2004JCTB}
MacLean, M.S.,
Taut distance-regular graphs of even diameter,
{\sl J. Combin. Theory Ser. B} 91 (2004), 127--142.

\bibitem{MacLean2012DM}
MacLean, M.S.,
A new approach to the Bipartite Fundamental Bound,
{\sl Discrete Math.} 312 (2012), 3195--3202.

\bibitem{MT2006DM}
MacLean, M.S., Terwilliger, P.,
Taut distance-regular graphs and the subconstituent algebra,
{\sl Discrete Math.} 306 (2006), 1694--1721;
\arxiv{math/0508399}.

\bibitem{MT2008DM}
MacLean, M.S., Terwilliger, P.,
The subconstituent algebra of a bipartite distance-regular graph; thin modules with endpoint two,
{\sl Discrete Math.} 308 (2008), 1230--1259;
\arxiv{math/0604351}.

\bibitem{MK10}  Markowsky, G.,  Koolen, J.H., A conjecture of
    Biggs concerning the resistance of a distance-regular
    graph, {\sl Electron. J. Combin.} 17 (2010), R78;
    \arxiv{1006.2687}.

\bibitem{Martinthesis} Martin, W.J., {\sl Completely regular subsets}, thesis,
    University of Waterloo, 1992; \url{http://users.wpi.edu/~martin/RESEARCH/THESIS/}.

\bibitem{Martin1994JAC}
Martin, W.J.,
Completely regular designs of strength one,
{\sl J. Algebraic Combin.} 3 (1994), 177--185.

\bibitem{Martin1998JCD}
Martin, W.J.,
Completely regular designs,
{\sl J. Combin. Des.} 6 (1998), 261--273.

\bibitem{Martin2001JCMCC}
Martin, W.J.,
Symmetric designs, sets with two intersection numbers and Krein parameters of incidence graphs,
{\sl J. Combin. Math. Combin. Comput.} 38 (2001), 185--196.

\bibitem{MartinCRC} Martin, W.J., Completely regular codes: a viewpoint and
    some problems, {\sl Proceedings of 2004 Com${}^2$MaC Workshop on
    Distance-Regular Graphs and Finite Geometry}, Pusan, Korea, 2004, pp.~43--56;
    \url{http://users.wpi.edu/~martin/RESEARCH/busan.pdf}.

\bibitem{Martin2010www} Martin, W.J., Cometric association
    schemes, \url{http://users.wpi.edu/~martin/RESEARCH/QPOL/} (April 2010).

\bibitem{Martin-pre}
Martin, W.J.,
Completely regular codes in the Odd graphs,
unpublished manuscript.

\bibitem{MMW07} Martin, W.J., Muzychuk, M., Williford, J.,
    Imprimitive
    cometric association schemes: constructions and analysis,
    {\sl J. Algebraic Combin.} 25 (2007), 399--415.

\bibitem{martintanaka} Martin, W.J., Tanaka, H., Commutative
    association schemes, {\sl European J. Combin.} 30
    (2009), 1497--1525;
    \arxiv{0811.2475}.

\bibitem{MT1997pre}
Martin, W.J., Taylor, T.D.,
On the subconstituent algebra of a completely regular code,
manuscript (1997).

\bibitem{MW2009EJC}
Martin, W.J., Williford, J.S.,
There are finitely many $Q$-polynomial association schemes with given first multiplicity at least three,
{\sl European J. Combin.} 30 (2009), 698--704.


\bibitem{MarZhupre} Martin, W.J., Zhu, R.R., Distance-regular graphs having
    an eigenvalue of small multiplicity, {\sl Univ. Waterloo Res. Rep.} CORR 92-06, 1996;
    \url{http://users.wpi.edu/~martin/RESEARCH/multmain.ps}.


\bibitem{MZ1995DCC}
Martin, W.J., Zhu, X.J.,
Anticodes for the Grassmann and bilinear forms graphs,
{\sl Des. Codes Cryptogr.} 6 (1995), 73--79.


\bibitem{MRR1978JCISS}
McEliece, R.J., Rodemich, E.R., Rumsey, H.C., Jr.,
The Lov\'{a}sz bound and some generalizations,
{\sl J. Combin. Inform. System Sci.} 3 (1978), 134--152.


\bibitem{Meixner91} Meixner, T., Some polar towers, {\sl
    European J. Combin.} 12 (1991), 397--415.

\bibitem{metsch91} Metsch, K., Improvement of Bruck's
    completion theorem, {\sl Des. Codes Cryptogr.} 1
    (1991), 99--116.



\bibitem{Me95} % MR1356853 (96g:05116)
Metsch, K., A characterization of Grassmann graphs, {\sl European J. Combin.}
16 (1995), 639--644.


\bibitem{M297} % MR1427606 (97m:05263)
Metsch, K., On the characterization of the folded Johnson graphs and the folded
halved cubes by their intersection arrays, {\sl European J. Combin.} 18 (1997), 65--74.

\bibitem{M197} % MR1485375 (98k:05122)
Metsch, K., Characterization of the folded Johnson graphs of small diameter by
their intersection arrays, {\sl European J. Combin.} 18 (1997),
901--913.

\bibitem{Me99} % MR1686364 (2000e:05169)
Metsch, K., On a characterization of bilinear forms graphs, {\sl European J.
Combin.} 20 (1999), 293--306.

\bibitem{Me03} % MR1993169 (2004e:05208)
Metsch, K., On the characterization of the folded halved cubes by their
intersection arrays,
{\sl Des. Codes Cryptogr.} 29 (2003), 215--225.

\bibitem{Metsch2014JCTA}
Metsch, K.,
An improved bound on the existence of Cameron--Liebler line classes,
{\sl J. Combin. Theory Ser. A} 121 (2014), 89--93.

\bibitem{Meyerowitz1992JCISS}
Meyerowitz, A.,
Cycle-balanced partitions in distance-regular graphs,
{\sl J. Combin. Inform. System Sci.} 17 (1992), 39--42.

\bibitem{Meyerowitz2003DM}
Meyerowitz, A.,
Cycle-balance conditions for distance-regular graphs,
{\sl Discrete Math.} 264 (2003), 149--165.

\bibitem{Miklavic2004EJC} Miklavi\v{c}, \v{S}., $Q$-polynomial distance-regular
    graphs with $a_1=0$, {\sl European J. Combin.} 25 (2004), 911--920.

\bibitem{Miklavic2005JCTB}
Miklavi\v{c}, \v{S}.,
An equitable partition for a distance-regular graph of negative type,
{\sl J. Combin. Theory Ser. B} 95 (2005), 175--188.

\bibitem{Miklavic2007DM} Miklavi\v{c}, \v{S}., On bipartite $Q$-polynomial
    distance-regular graphs with $c_2=1$, {\sl Discrete Math.} 307 (2007),
    544--553.

\bibitem{Miklavic2007EJC}
Miklavi\v{c}, \v{S}.,
On bipartite $Q$-polynomial distance-regular graphs,
{\sl European J. Combin.} 28 (2007), 94--110.

\bibitem{Mik09} Miklavi\v c, \v S., The Terwilliger
    algebra of a distance-regular graph of negative type,
    {\sl Linear Algebra
    Appl.} 430 (2009), 251--270;
    \arxiv{0804.1650}.

\bibitem{Miklavic2009EJC}
Miklavi\v{c}, \v{S}.,
$Q$-polynomial distance-regular graphs with $a_1=0$ and $a_2\ne 0$,
{\sl European J. Combin.} 30 (2009), 192--207.

\bibitem{Miklavic2013GC} Miklavi\v{c}, \v{S}., On bipartite distance-regular
    graphs with intersection numbers $c_i=(q^i-1)/(q-1)$, {\sl Graphs Combin.}
    29 (2013), 121--130.

\bibitem{MP2003EJC}
Miklavi\v{c}, \v{S}., Poto\v{c}nik, P.,
Distance-regular circulants,
{\sl European J. Combin.} 24 (2003), 777--784.

\bibitem{MP2007JCTB}
Miklavi\v{c}, \v{S}., Poto\v{c}nik, P.,
Distance-regular Cayley graphs on dihedral groups,
{\sl J. Combin. Theory Ser. B} 97 (2007), 14--33.

\bibitem{MS2014JCTB}
Miklavi\v{c}, \v{S}., \v{S}parl, P.,
On distance-regular Cayley graphs on abelian groups,
{\sl J. Combin. Theory Ser. B} 108 (2014), 102--122;
\arxiv{1205.6948}.

\bibitem{MT2011pre} Miklavi\v{c}, \v{S}., Terwilliger, P., Bipartite
    $Q$-polynomial distance-regular graphs and uniform posets, {\sl J. Algebraic Combin.} 38 (2013), 225--242;
    \arxiv{1108.2484}.


\bibitem{Mdrline} Mohar, B., Shawe-Taylor, J.,
    Distance-biregular graphs with 2-valent vertices and
    distance-regular line graphs, {\sl J. Combin. Theory Ser. B} 38 (1985),
    193--203.

\bibitem{Moon} Moon, A., Characterization of the odd graphs $O_k$ by
    parameters, {\sl Discrete Math.} 42 (1982), 91--97.

\bibitem{MR2002P}
Moore, C., Russell, A.,
Quantum walks on the hypercube,
{\sl Randomization and Approximation Techniques in Computer Science} (J.D.P. Rolim, S. Vadhan, eds.),
Lecture Notes in Computer Science, vol.~2483,
Springer-Verlag, Berlin, 2002, pp.~164--178;
\arxiv{quant-ph/0104137}.

\bibitem{Williford2014AGT}
%Williford, J.,
%$Q$-polynomial association schemes,
%a talk given at {\sl Modern Trends in Algebraic Graph Theory},
%Villanova University, Villanova, PA, USA, June 2--5, 2014;
%\url{http://www.csc.villanova.edu/ModernTrends/MSC154/Day3Talks/Williford.pdf}.
Moorhouse, G.E., Williford, J.,
Double covers of symplectic dual polar graphs,
%preprint (2015);
{\sl Discrete Math.} 339 (2016), 571--588;
\arxiv{1504.01067}.

\bibitem{MP2012pre}
%Morales, J.V.S., Pascasio, A.A.,
%An action of the tetrahedron algebra on the standard module for the Hamming graphs and Doob graphs,
%{\sl Graphs Combin.}, to appear.
Morales, J.V.S., Pascasio, A.A.,
An action of the tetrahedron algebra on the standard module for the Hamming graphs and Doob graphs,
{\sl Graphs Combin.} 30 (2014), 1513--1527.

\bibitem{Munemasa1986GC}
Munemasa, A.,
An analogue of $t$-designs in the association schemes of alternating bilinear forms,
{\sl Graphs Combin.} 2 (1986), 259--267.

\bibitem{Munemasa2004EJC}
Munemasa, A.,
Spherical $5$-designs obtained from finite unitary groups,
{\sl European J. Combin.} 25 (2004), 261--267.

\bibitem{Munemasa2014SHCC}
Munemasa, A., Godsil-McKay switching and twisted Grassmann graphs,
preprint (2015);
\arxiv{1512.09232}.

\bibitem{MPS1993JAC}
Munemasa, A., Pasechnik, D.V., Shpectorov, S.V.,
The automorphism group and the convex subgraphs of the quadratic forms graph in characteristic $2$,
{\sl J. Algebraic Combin.} 2 (1993), 411--419.

\bibitem{MuTo09} Munemasa, A., Tonchev, V.D., The
    twisted Grassmann graph is the block graph of a design,
    Innov. Incidence Geom. 12 (2011), 1--6;
    \arxiv{0906.4509}.

\bibitem{Muzy07} Muzychuk, M., A generalization of
    Wallis--Fon-Der-Flaass construction of strongly regular
    graphs, {\sl J. Algebraic Combin.} 25 (2007), 169--187.



\bibitem{N01} % MR1876578 (2003b:05161)
Nakano, H., On a distance-regular graph of even height with $k\sb e=k\sb f$,
{\sl Graphs Combin.} 17 (2001), 707--716.


\bibitem{Neu80} Neumaier, A., Strongly regular graphs with
    smallest eigenvalue $-m$, {\sl Arch. Math.} 33
    (1980), 392--400.

\bibitem{Neu-b1} Neumaier, A., Characterization of a class
    of distance regular graphs, {\sl J. Reine Angew. Math.} 357 (1985), 182--192.

\bibitem{Neu1990JCTA}  Neumaier, A., Krein conditions and near polygons,
    {\sl J. Combin. Theory Ser. A} 54 (1990), 201--209.

\bibitem{Neu92} Neumaier, A., Completely regular codes, {\sl Discrete Math.}
    106-107 (1992), 353--360.

\bibitem{N04} % MR2070547 (2005a:05223)
Neumaier, A., Dual polar spaces as extremal distance-regular graphs, {\sl
European J. Combin.} 25 (2004), 269--274.

\bibitem{N}
Newman, M.,
{\sl Integral Matrices},
Academic Press, New York-London, 1972.

\bibitem{Nomura90} Nomura, K., Distance-regular graphs of Hamming type, {\sl J.
    Combin. Theory Ser. B} 50 (1990), 160--167.

\bibitem{N294} Nomura, K., Homogeneous graphs and regular near polygons, {\sl
    J. Combin. Theory Ser. B} 60 (1994), 63--71.

\bibitem{Nomura1995JCTB} Nomura, K., Spin models on bipartite distance-regular
    graphs, {\sl J. Combin. Theory Ser. B} 64 (1995), 300--313.

\bibitem{Nomura1996P}
Nomura, K.,
Spin models and almost bipartite $2$-homogeneous graphs,
{\sl Progress in Algebraic Combinatorics} (E. Bannai, A. Munemasa, eds.),
Advanced Studies in Pure Mathematics, vol.~24,
Mathematical Society of Japan, Tokyo, 1996, pp.~285--308.

\bibitem{Nomura1997JAC}
Nomura, K.,
An algebra associated with a spin model,
{\sl J. Algebraic Combin.} 6 (1997), 53--58.

\bibitem{Nomura2002KJM}
Nomura, K.,
A property of solutions of modular invariance equations for distance-regular graphs,
{\sl Kyushu J. Math.} 56 (2002), 53--57.

\bibitem{NT2008LAAd}
Nomura, K., Terwilliger, P.,
The structure of a tridiagonal pair,
{\sl Linear Algebra Appl.} 429 (2008), 1647--1662;
\arxiv{0802.1096}.

\bibitem{NT2009LAAa}
Nomura, K., Terwilliger, P.,
Tridiagonal pairs and the $\mu$-conjecture,
{\sl Linear Algebra Appl.} 430 (2009), 455--482;
\arxiv{0908.2604}.

\bibitem{NT2010LAAa}
Nomura, K., Terwilliger, P.,
On the shape of a tridiagonal pair,
{\sl Linear Algebra Appl.} 432 (2010), 615--636;
\arxiv{0906.3838}.

\bibitem{NT2010LAAb}
Nomura, K., Terwilliger, P.,
Tridiagonal pairs of $q$-Racah type and the $\mu$-conjecture,
{\sl Linear Algebra Appl.} 432 (2010), 3201--3209;
\arxiv{0908.3151}.

\bibitem{NT2011LAA} Nomura, K., Terwilliger, P., Tridiagonal matrices with
    nonnegative entries,
    {\sl Linear Algebra Appl.} 434 (2011), 2527--2538;
    \arxiv{1010.1305}.

\bibitem{Nozaki2013pre}
Nozaki, H.,
Polynomial properties on large symmetric association schemes,
%preprint (2013);
{\sl Ann. Comb.}, to appear;
\arxiv{1305.2539}.

\bibitem{PanLuWeng08} Pan, Y., Lu, M., Weng, C.,
    Triangle-free distance-regular graphs, {\sl J. Algebraic Combin.} 27 (2008),
    23--34.

\bibitem{PanWeng08} Pan, Y., Weng, C., $3$-Bounded property in a
    triangle-free distance-regular graph, {\sl European J.
    Combin.} 29 (2008), 1634--1642;
    \arxiv{0709.0564}.

\bibitem{PanWeng09} Pan, Y., Weng, C., A note on triangle-free
    distance-regular graphs with $a_2 \neq 0$, {\sl J. Combin. Theory Ser. B} 99
    (2009), 266--270.

\bibitem{Papre12} Park, J., The distance-regular graphs with
    valency $k$ and number of vertices at most $3k+1$, preprint (2012).

\bibitem{PaKoMar} Park, J., Koolen, J.H., Markowsky, G., There are only finitely
    many distance-regular graphs with valency $k$ at least three, fixed ratio
    $\frac{k_2}{k}$ and large diameter, {\sl J. Combin. Theory Ser. B} 103
    (2013), 733--741;
    \arxiv{1012.2632}.

\bibitem{Pascasio1999JAC}
Pascasio, A.A.,
Tight graphs and their primitive idempotents,
{\sl J. Algebraic Combin.} 10 (1999), 47--59.

\bibitem{Pascasio2001GC} Pascasio, A.A., Tight distance-regular graphs and the
    $Q$-polynomial property, {\sl Graphs Combin.} 17 (2001), 149--169.

\bibitem{Pascasio2002EJC} Pascasio, A.A., On the multiplicities of the
    primitive idempotents of a $Q$-polynomial distance-regular graph, {\sl
    European J. Combin.} 23 (2002), 1073--1078.

\bibitem{Pascasio2003DM} Pascasio, A.A., An inequality in character algebras,
    {\sl Discrete Math.} 264 (2003), 201--209.

\bibitem{Pascasio2008DM} Pascasio, A.A., A characterization of $Q$-polynomial
    distance-regular graphs, {\sl Discrete Math.} 308 (2008), 3090--3096.

\bibitem{PT2006LAA}
Pascasio, A.A., Terwilliger, P.,
The pseudo-cosine sequences of a distance-regular graph,
{\sl Linear Algebra Appl.} 419 (2006), 532--555;
\arxiv{math/0312150}.

\bibitem{PY01} % MR1829749 (2002b:05139)
Pasini, A., Yoshiara, S., New distance regular graphs arising from dimensional
dual hyperovals, {\sl European J. Combin.} 22 (2001), 547--560.

\bibitem{Peetersprank} Peeters, R., On the $p$-ranks of the adjacency matrices
    of distance-regular graphs, {\sl J. Algebraic Combin.} 15 (2002), 127--149.

\bibitem{PenWil2011} Penttila, T., Williford, J., New families of
    $Q$-polynomial association schemes, {\sl J. Combin.
    Theory Ser. A} 118 (2011), 502--509.

\bibitem{PSV2011JCTA}
Pepe, V., Storme, L., Vanhove, F.,
Theorems of Erd\H{o}s--Ko--Rado type in polar spaces,
{\sl J. Combin. Theory Ser. A} 118 (2011), 1291--1312.

\bibitem{Pow88} Powers, D.L., Eigenvectors of distance-regular graphs, {\sl
    SIAM J. Matrix Anal. Appl.} 9 (1988), 399--407.


\bibitem{Powerssemiregular} Powers, D.L., Semiregular graphs and their algebra,
    {\sl Linear Multilinear Algebra} 24 (1988), 27--37.



\bibitem{Py99}
Pyber, L., A bound for the diameter of distance-regular graphs, {\sl
Combinatorica} 19 (1999), 549--553.

\bibitem{PyberHam}
%Pyber, L., Large connected strongly regular graphs are Hamiltonian, preprint (2009).
%
%\bibitem{Pyber2014pre}
Pyber, L.,
Large connected strongly regular graphs are Hamiltonian,
preprint (2014);
\arxiv{1409.3041}.


\bibitem{RCSprague} Ray-Chaudhuri, D.K., Sprague, A.P., Characterization of
    projective incidence structures, {\sl Geom. Dedicata} 5 (1976), 361--376.


\bibitem{RiHu} Rif\`{a}, J., Huguet, L., Classification of a class of distance-regular graphs via completely regular codes, {\sl Discrete Appl. Math.} 26 (1990), 289--300.

\bibitem{RiZipre08}
Rif\`{a}, J., Zinoviev, V.A.,
On a class of binary linear completely transitive codes with arbitrary covering radius,
{\sl Discrete Math.} 309 (2009), 5011--5016.

\bibitem{RZ2010IEEE}
Rif\`{a}, J., Zinoviev, V.A.,
New completely regular $q$-ary codes based on Kronecker products,
{\sl IEEE Trans. Inform. Theory} 56 (2010), 266--272;
\arxiv{0810.4993}.

\bibitem{RiZi11}
Rif\`{a}, J., Zinoviev, V.A.,
On lifting perfect codes,
{\sl IEEE Trans. Inform. Theory} 57 (2011), 5918--5925;
\arxiv{1002.0295}.

\bibitem{Rob16}
Roberson, D.E., Homomorphisms of strongly regular graphs, preprint
(2016);
\arxiv{1601.00969}.

\bibitem{r97} Rowlinson, P., Linear algebra, {\sl Graph
    Connections} (L.W. Beineke, R.J. Wilson, eds.),
    Oxford Lecture Series in Mathematics and its Applications, vol.~5,
    Oxford University Press, New York, 1997, pp.~86--99.

\bibitem{Salimi} Salimi, S., Quantum central limit theorem for
    continuous-time quantum walks on Odd graphs in quantum probability theory,
    {\sl Int. J. Theor. Phys.} 47 (2008), 3298--3309;
    \arxiv{0710.3043}.

\bibitem{Schrijver1979IEEE}
Schrijver, A.,
A comparison of the Delsarte and Lov\'{a}sz bounds,
{\sl IEEE Trans. Inform. Theory} 25 (1979), 425--429.

\bibitem{Schrijver2005IEEE}
Schrijver, A.,
New code upper bounds from the Terwilliger algebra and semidefinite programming,
{\sl IEEE Trans. Inform. Theory} 51 (2005), 2859--2866.


\bibitem{Seidel-2} Seidel, J.J., Strongly regular graphs with
    $(-1,1,0)$
    adjacency matrix having eigenvalue 3, {\sl Linear Algebra
    Appl.}
    1 (1968), 281--298.

\bibitem{Shimabukuro2005AC}
Shimabukuro, O.,
An analogue of Nakayama's conjecture for Johnson schemes,
{\sl Ann. Comb.} 9 (2005), 101--115.

\bibitem{Shimabukuro2007EJC}
Shimabukuro, O.,
On the number of irreducible modular representations of a $P$ and $Q$ polynomial scheme,
{\sl European J. Combin.} 28 (2007), 145--151.

\bibitem{Shimabukuro2011DM}
Shimabukuro, O.,
On structures of modular adjacency algebras of Johnson schemes,
{\sl Discrete Math.} 311 (2011), 978--983.

\bibitem{SY2014pre}
%Shimabukuro, O., Yoshikawa, M.,
%Modular adjacency algebras of Grassmann graphs,
%preprint (2014).
Shimabukuro, O., Yoshikawa, M.,
Modular adjacency algebras of Grassmann graphs,
{\sl Linear Algebra Appl.} 466 (2015), 208--217.

\bibitem{Shp98} % MR1600295 (98j:05131)
Shpectorov, S.V., Distance-regular isometric subgraphs of the halved cubes,
{\sl European J. Combin.} 19 (1998), 119--136.

\bibitem{Simon1983P}
Simon, H.-U.,
A tight $\Omega(\log\log n)$-bound on the time for parallel RAMs to compute nondegenerated Boolean functions,
{\sl Foundations of Computation Theory} (M. Karpinski, ed.),
Lecture Notes in Computer Science, vol.~158, Springer-Verlag, Berlin, 1983, pp.~439--444.

\bibitem{Slijpe84} Van Slijpe, A.R.D., Random walks on regular polyhedra and
    other distance-regular graphs, {\sl Stat. Neerl.} 38 (1984), 273--292.


\bibitem{So93} Soicher, L.H., Three new distance-regular
    graphs,
    {\sl European J. Combin.} 14 (1993), 501--505.

\bibitem{So95} % MR1312734 (95k:05186)
Soicher, L.H., Yet another distance-regular graph related to a Golay code,
{\sl Electron. J. Combin.} 2 (1995), N1.

\bibitem{Soicher15}
Soicher, L.H., The uniqueness of a distance-regular graph with
intersection array $\{32,27,8,1;1,4,27,32\}$ and related results,
preprint (2015);
\arxiv{1512.05976}.


\bibitem{Sole1990DM}
Sol\'{e}, P.,
Completely regular codes and completely transitive codes,
{\sl Discrete Math.} 81 (1990), 193--201.

\bibitem{Sotirov2012B} Sotirov, R., SDP relaxations for some combinatorial
    optimization problems, {\sl Handbook on Semidefinite, Conic and Polynomial
    Optimization} (M.F. Anjos, J.B. Lasserre, eds.), Springer, New York, 2012, pp.~795--819.

\bibitem{Sprague} Sprague, A.P., Incidence structures whose
    planes are nets, {\sl European J. Combin.} 2
    (1981), 193--204.

\bibitem{Stanton1981GD}
Stanton, D.,
Three addition theorems for some $q$-Krawtchouk polynomials,
{\sl Geom. Dedicata} 10 (1981), 403--425.

\bibitem{Stanton1985JCTA}
Stanton, D.,
Harmonics on posets,
{\sl J. Combin. Theory Ser. A} 40 (1985), 136--149.

\bibitem{Stanton1986GC}
Stanton, D.,
$t$-Designs in classical association schemes,
{\sl Graphs Combin.} 2 (1986), 283--286.

\bibitem{Suda2011JCD}
Suda, S.,
On spherical designs obtained from $Q$-polynomial association schemes,
{\sl J. Combin. Des.} 19 (2011), 167--177;
\arxiv{0910.4628}.

\bibitem{Suda2012JCTA}
Suda, S.,
New parameters of subsets in polynomial association schemes,
{\sl J. Combin. Theory Ser. A} 119 (2012), 117--134;
\arxiv{1008.0189}.

\bibitem{Suda2012EJC} Suda, S., On $Q$-polynomial association schemes of small
    class, {\sl Electron. J. Combin.} 19:1 (2012), P68;
    \arxiv{1202.5627}.

\bibitem{Suda2009pre}
%Suda, S.,
%Characterizations of regularity for certain $Q$-polynomial association schemes,
%preprint (2009);
Suda, S.,
Characterizations of regularity for certain $Q$-polynomial association schemes,
{\sl Electron. J. Combin.} 22:1 (2015), P1.12;
\arxiv{0910.4629}.

\bibitem{WS16}
Sumalroj, S., Worawannotai, C., The nonexistence of a
distance-regular graph with intersection array
$\{22,16,5;1,2,20\}$, {\sl Electron. J. Combin.} 23:1 (2016), P1.32.

\bibitem{Su91} % MR1302113 (95m:05252)
Suzuki, H., Bounding the diameter of a distance regular graph by a function of
$k\sb {d}$, {\sl Graphs Combin.} 7 (1991), 363--375.

\bibitem{S294} % MR1275269 (95b:05218)
Suzuki, H., On distance-regular graphs with $k\sb i=k\sb j$,
{\sl J. Combin. Theory Ser. B} 61 (1994), 103--110.

\bibitem{S594} % MR1302113 (95m:05252)
Suzuki, H., Bounding the diameter of a distance regular graph by a function of
$k\sb {d}$, II, {\sl J. Algebra} 169 (1994), 713--750.

\bibitem{Su95} % MR1358679 (96k:05214)
Suzuki, H., Distance-semiregular graphs, {\sl Algebra Colloq.} 2 (1995),
315--328.

\bibitem{Su295} % MR1324430 (96m:05200)
Suzuki, H., On strongly closed subgraphs of highly regular graphs, {\sl
European J. Combin.} 16 (1995), 197--220.

\bibitem{S96} % MR1447927 (98g:05160)
Suzuki, H., Strongly closed subgraphs of a distance-regular graph with
geometric girth five, {\sl Kyushu J. Math.} 50 (1996), 371--384.

\bibitem{Suzuki1996JCTA}
Suzuki, H., A note on association schemes with two $P$-polynomial structures of Type III, {\sl J. Combin. Theory Ser.  A} 74 (1996), 158--168.

\bibitem{Suzuki1998JACa}
Suzuki, H.,
Imprimitive $Q$-polynomial association schemes,
{\sl J. Algebraic Combin.} 7 (1998), 165--180.

\bibitem{Suzuki1998JACb}
Suzuki, H.,
Association schemes with multiple $Q$-polynomial structures,
{\sl J. Algebraic Combin.} 7 (1998), 181--196.

\bibitem{Su99} Suzuki, H., An introduction to distance-regular
    graphs, {\sl Three Lectures in Algebra} (K. Shinoda, ed.), Sophia
    Kokyuroku in Mathematics, vol.~41, Sophia University, Tokyo, 1999, pp.~57--132.

\bibitem{Suzuki2005JAC}
Suzuki, H.,
The Terwilliger algebra associated with a set of vertices in a distance-regular graph,
{\sl J. Algebraic Combin.} 22 (2005), 5--38.

\bibitem{Suzuki2006EJC}
Suzuki, H.,
The geometric girth of a distance-regular graph having certain thin irreducible modules for the Terwilliger algebra,
{\sl European J. Combin.} 27 (2006), 235--254.

\bibitem{Suzuki2007EJC}
Suzuki, H.,
On strongly closed subgraphs with diameter two and the $Q$-polynomial property,
{\sl European J. Combin.} 28 (2007), 167--185.

\bibitem{Suzuki2008GC}
Suzuki, H.,
Almost $2$-homogeneous graphs and completely regular quadrangles,
{\sl Graphs Combin.} 24 (2008), 571--585.

\bibitem{Suzuki2014JAC}
Suzuki, H.,
Completely regular clique graphs,
{\sl J. Algebraic Combin.} 40 (2014), 233--244.

\bibitem{Tanabe1997JAC} Tanabe, K., The irreducible modules of the Terwilliger
    algebras of Doob schemes, {\sl J. Algebraic Combin.} 6 (1997), 173--195.

\bibitem{Tanaka2006JCTA} Tanaka, H., Classification of subsets with minimal
    width and dual width in Grassmann, bilinear forms and dual polar graphs,
    {\sl J. Combin. Theory Ser. A} 113 (2006), 903--910.

\bibitem{Tanaka2009EJC}
Tanaka, H.,
New proofs of the Assmus--Mattson theorem based on the Terwilliger algebra,
{\sl European J. Combin.} 30 (2009), 736--746;
\arxiv{math/0612740}.

\bibitem{Tanaka2009LAAa}
Tanaka, H.,
A note on the span of Hadamard products of vectors,
{\sl Linear Algebra Appl.} 430 (2009), 865--867;
\arxiv{0806.2075}.

\bibitem{Tanaka2009LAAb}
Tanaka, H.,
A bilinear form relating two Leonard systems,
{\sl Linear Algebra Appl.} 431 (2009), 1726--1739;
\arxiv{0807.0385}.

\bibitem{Tanaka2011EJC} Tanaka, H., Vertex subsets with minimal width and dual
    width in $Q$-polynomial distance-regular graphs,
    {\sl Electron. J. Combin.} 18:1 (2011), P167;
    \arxiv{1011.2000}.

\bibitem{Tanaka2010pre} Tanaka, H., The Erd\H{o}s--Ko--Rado theorem for twisted
    Grassmann graphs, {\sl Combinatorica} 32 (2012), 735--740;
    \arxiv{1012.5692}.

\bibitem{Tanaka2012pre}
Tanaka, H.,
The Erd\H{o}s--Ko--Rado basis for a Leonard system,
{\sl Contrib. Discrete Math.} 8 (2013), 41--59;
\arxiv{1208.4050}.

\bibitem{TT2011EJC}
Tanaka, H., Tanaka, R.,
Nonexistence of exceptional imprimitive $Q$-polynomial association schemes with six classes,
{\sl European J. Combin.} 32 (2011), 155--161;
\arxiv{1005.3598}.

\bibitem{TTW16+}
Tanaka, H., Tanaka, R., Watanabe, Y.,
The Terwilliger algebra of a $Q$-polynomial distance-regular graph with respect to a set of vertices,
in preparation.

\bibitem{Teirlinck1987DM}
Teirlinck, L.,
Nontrivial $t$-designs without repeated blocks exist for all $t$,
{\sl Discrete Math.} 65 (1987), 301--311.

\bibitem{TerMult82} Terwilliger, P., Eigenvalue multiplicities of highly
    symmetric graphs, {\sl Discrete Math.} 41 (1982), 295--302.

\bibitem{Terwscak} Terwilliger, P., Distance-regular graphs and
    $(s,c,a,k)$-graphs, {\sl J. Combin. Theory Ser. B} 34 (1983), 151--164.

\bibitem{Ter-quad} Terwilliger, P., Distance-regular graphs with girth $3$ or $4$:
    I, {\sl J. Combin. Theory Ser. B} 39 (1985), 265--281.

\bibitem{Terwilliger1985AGG}
Terwilliger, P.,
Counting $4$-vertex configurations in $P$- and $Q$-polynomial association schemes,
%Proceedings of the conference on groups and geometry, Part B (Madison, Wis., 1985).
{\sl Algebras Groups Geom.} 2 (1985), 541--554.

\bibitem{Ter-b1} Terwilliger, P., The Johnson graph $J(d,r)$
    is unique if $(d,r) \neq (2,8)$, {\sl Discrete Math.} 58 (1986), 175--189.

\bibitem{Terwilliger1986JCTB} Terwilliger, P., A class of distance-regular
    graphs that are $Q$-polynomial, {\sl J. Combin. Theory Ser. B} 40 (1986),
    213--223.

\bibitem{Ter-root}
Terwilliger, P.,
Root systems and the Johnson and Hamming graphs,
{\sl European J. Combin.} 8 (1987), 73--102.

\bibitem{Terwilliger1987JCTA} Terwilliger, P., A characterization of $P$- and
    $Q$-polynomial association schemes, {\sl J. Combin. Theory Ser. A} 45
    (1987), 8--26.

\bibitem{Terwilliger1987JCTB} Terwilliger, P., $P$ and $Q$ polynomial schemes
    with $q=-1$, {\sl J. Combin. Theory Ser. B} 42 (1987), 64--67.

\bibitem{Terwilliger1988C} Terwilliger, P., The classification of
    distance-regular graphs of type IIB, {\sl Combinatorica} 8 (1988),
    125--132.

\bibitem{Terwilliger1988GC} Terwilliger, P., Balanced sets and $Q$-polynomial
    association schemes, {\sl Graphs Combin.} 4 (1988), 87--94.

\bibitem{Terwilliger1990P} Terwilliger, P., The incidence algebra of a uniform
    poset, {\sl Coding Theory and Design Theory, Part I} (D. Ray-Chaudhuri,
    ed.), The IMA Volumes in Mathematics and its Applications, vol.~20,
    Springer-Verlag, New York, 1990, pp.~193--212.

\bibitem{Talgebra92} Terwilliger, P., The subconstituent
    algebra of an association scheme, I, {\sl J. Algebraic Combin.} 1
    (1992), 363--388; II, {\sl J. Algebraic Combin.}
    2 (1993), 73--103; III, {\sl J. Algebraic Combin.} 2
    (1993), 177--210.

\bibitem{Terwilliger1993EJC}
Terwilliger, P.,
$P$- and $Q$-polynomial association schemes and their antipodal $P$-polynomial covers,
{\sl European J. Combin.} 14 (1993), 355--358.

\bibitem{Terwilliger1993N} Terwilliger, P., The subconstituent algebra of a
    graph, the thin condition, and the $Q$-polynomial property, unpublished
    lecture notes (1993).

\bibitem{Terwilliger1995EJC} Terwilliger, P., Kite-free distance-regular
    graphs, {\sl European J. Combin.} 16 (1995), 405--414.

\bibitem{Terwilliger1995DM} Terwilliger, P., A new inequality for
    distance-regular graphs, {\sl Discrete Math.} 137 (1995), 319--332.

\bibitem{Terwilliger1996P} Terwilliger, P., Quantum matroids, {\sl Progress in
    Algebraic Combinatorics} (E. Bannai, A. Munemasa, eds.), Advanced Studies
    in Pure Mathematics, vol.~24, Mathematical Society of Japan, Tokyo,
    1996, pp.~323--441.

\bibitem{Terwilliger2001P} Terwilliger, P., Two relations that generalize the
    $q$-Serre relations and the Dolan--Grady relations, {\sl Physics and
    Combinatorics 1999} (A.N. Kirillov, A. Tsuchiya, H. Umemura, eds.), World
    Scientific Publishing, River Edge, NJ, 2001, pp.~377--398;
    \arxiv{math/0307016}.

\bibitem{Terwilliger2001LAA}
Terwilliger, P.,
Two linear transformations each tridiagonal with respect to an eigenbasis of the other,
{\sl Linear Algebra Appl.} 330 (2001), 149--203;
\arxiv{math/0406555}.

\bibitem{Terwilliger2002LAA} Terwilliger, P., The subconstituent algebra of a
    distance-regular graph; thin modules with endpoint one, {\sl Linear Algebra
    Appl.} 356 (2002), 157--187.

\bibitem{Terwilliger2004JAC} Terwilliger, P., An inequality involving the local
    eigenvalues of a distance-regular graph, {\sl J. Algebraic Combin.} 19
    (2004), 143--172.

\bibitem{Terwilliger2005GC}
Terwilliger, P.,
The displacement and split decompositions for a $Q$-polynomial distance-regular graph,
{\sl Graphs Combin.} 21 (2005), 263--276;
\arxiv{math/0306142}.

\bibitem{Terwilliger2006N}
Terwilliger, P.,
An algebraic approach to the Askey scheme of orthogonal polynomials,
{\sl Orthogonal Polynomials and Special Functions, Computation and Applications} (F. Marcell\'{a}n, W. Van Assche, eds.),
Lecture Notes in Mathematics, vol.~1883,
Springer-Verlag, Berlin, 2006, pp.~255--330;
\arxiv{math/0408390}.

\bibitem{TW04}
Terwilliger, P., Weng, C.,
Distance-regular graphs, pseudo primitive idempotents, and the Terwilliger algebra,
{\sl European J. Combin.} 25 (2004), 287--298;
\arxiv{math/0307269}.

\bibitem{TW05} Terwilliger, P., Weng, C., An inequality
    for regular near polygons, {\sl European J. Combin.} 26
    (2005), 227--235;
    \arxiv{math/0312149}.

\bibitem{TW2013AMC}
Terwilliger, P., Worawannotai, C.,
Augmented down-up algebras and uniform posets,
{\sl Ars Math. Contemp.} 6 (2013), 409--417;
\arxiv{1206.0455}.

\bibitem{TZ2013pre}
Terwilliger, P., \v{Z}itnik, A.,
Distance-regular graphs of $q$-Racah type and the universal Askey-Wilson algebra,
{\sl J. Combin. Theory Ser. A} 125 (2014), 98--112;
\arxiv{1307.7968}.

\bibitem{To96} % MR1371269 (96k:05215)
Tomiyama, M., On distance-regular graphs with height two, {\sl J. Algebraic
Combin.} 5 (1996), 57--76.

\bibitem{To98} % MR1609869 (99f:05128)
Tomiyama, M., On distance-regular graphs with height two, II, {\sl J. Algebraic
Combin.} 7 (1998), 197--220.

\bibitem{Tomiyama2001DM}
Tomiyama, M.,
On the primitive idempotents of distance-regular graphs,
{\sl Discrete Math.} 240 (2001), 281--294.

\bibitem{TY1994KJM}
Tomiyama, M., Yamazaki, N.,
The subconstituent algebra of a strongly regular graph,
{\sl Kyushu J. Math.} 48 (1994), 323--334.

\bibitem{JurTonpre} Tonejc, J., More balancing for distance-regular graphs, {\sl European J. Combin.} 34 (2013),
    195--206.

\bibitem{urlep12}
Urlep, M.,
Triple intersection numbers of $Q$-polynomial distance-regular graphs,
{\sl European J. Combin.} 33 (2012), 1246--1252.

\bibitem{Va08} Vallentin, F., Optimal distortion embeddings of
    distance regular graphs into Euclidean spaces, {\sl J. Combin. Theory Ser. B} 98 (2008), 95--104;
\arxiv{math/0509716}.

\bibitem{Vanhove2011PhD}
Vanhove, F.,
{\sl Incidence geometry from an algebraic graph theory point of view},
thesis,
Ghent University, 2011;
\url{https://cage.ugent.be/geometry/Theses/50/VanhovePhd.pdf}.

\bibitem{Vanhove2011JCD}
Vanhove, F.,
Antidesigns and regularity of partial spreads in dual polar graphs,
{\sl J. Combin. Des.} 19 (2011), 202--216.

\bibitem{Vanhove2012JAC} Vanhove, F., A Higman inequality for regular near
    polygons, {\sl J. Algebraic Combin.} 34 (2011), 357--373.

\bibitem{Vidali} Vidali, J., There is no distance-regular graph with intersection array $\{55, 54, 50, \break 35, 10; 1, 5, 20, 45, 55\}$, preprint (2013).

\bibitem{VJ2013pre}
Vidali, J., Juri\v{s}i\'{c}, A.,
Nonexistence of a family of tight distance-regular graphs with classical parameters,
preprint (2013).

\bibitem{Waji94} Wajima, M., A remark on distance-regular graphs with a circuit
    of diameter $t+1$, {\sl Math. Japon.} 40 (1994),
    433--437.


\bibitem{W01} % MR1846647 (2002j:05154)
Wang, K., The existence of strongly closed subgraphs in highly regular graphs,
{\sl Algebra Colloq.} 8 (2001), 257--266.

\bibitem{w82} Weichsel, P.M., On distance-regularity in
    graphs,
    {\sl J. Combin. Theory Ser. B} 32 (1982), 156--161.

\bibitem{Weng1995GC} Weng, C.-W., Kite-free $P$- and $Q$-polynomial schemes,
    {\sl Graphs Combin.} 11 (1995), 201--207.

\bibitem{W97} % MR1429246 (97m:05265)
Weng, C., $D$-bounded distance-regular graphs, {\sl European J. Combin.} 18
(1997), 211--229.

\bibitem{W98} % MR1645986 (99f:05129)
Weng, C., Weak-geodetically closed subgraphs in distance-regular graphs, {\sl
Graphs Combin.} 14 (1998), 275--304.

\bibitem{We99} % MR1687322 (2000d:05130)
Weng, C., Classical distance-regular graphs of negative type, {\sl J. Combin.
Theory Ser. B} 76 (1999), 93--116.

\bibitem{Wilson1975JCTA}
Wilson, R.M.,
An existence theory for pairwise balanced designs, III, Proof of the existence conjectures,
{\sl J. Combin. Theory Ser. A} 18 (1975), 71--79.

\bibitem{Worawannotai2012PhD}
Worawannotai, C.,
Dual polar graphs, the quantum algebra $U_q(\mathfrak{sl}_2)$, and Leonard systems of dual $q$-Krawtchouk type,
{\sl Linear Algebra Appl.} 438 (2013), 443--497;
\arxiv{1205.2144}.

\bibitem{Y95} % MR1345697 (96e:05184)
Yamazaki, N., Distance-regular graphs with $\Gamma(x)\simeq 3*K\sb {a+1}$, {\sl
European J. Combin.} 16 (1995), 525--536.

\bibitem{Yamazaki1996JCTB}
Yamazaki, N.,
Bipartite distance-regular graphs with an eigenvalue of multiplicity $k$,
{\sl J. Combin. Theory Ser. B} 66 (1996), 34--37.

\bibitem{Yoshikawa2004JAC}
Yoshikawa, M.,
Modular adjacency algebras of Hamming schemes,
{\sl J. Algebraic Combin.} 20 (2004), 331--340.

\bibitem{ZGG09} Zhang, X., Guo, J., Gao, S., Two new
    error-correcting pooling designs from $d$-bounded
    distance-regular graphs, {\sl J. Comb. Optim.} 17 (2009), 339--345.

\bibitem{Zhuthesis} Zhu, R.R., {\sl Distance-regular graphs and eigenvalue
    multiplicities}, thesis, Simon Fraser University, 1989;
    \url{http://ir.lib.sfu.ca/bitstream/1892/6153/1/b14460099.pdf}.

\bibitem{Zhu93} Zhu, R.R., Distance-regular graphs with an eigenvalue of
    multiplicity four, {\sl J. Combin. Theory Ser. B} 57 (1993),
    157--182.


%\medskip
%\hrule
%\smallskip


\end{thebibliography}
