Distance-regular graphs

Hua, L., Geometries of matrices. I. Generalizations of Von Staudt’s theorem, Trans. Amer. Math. Soc

1945

Earlier work this paper cites.

Bose, R.C., Strongly regular graphs, partial geometries and partially balanced designs, Pacific J. Math

1963

Earlier work this paper cites.

Hoffman, A.J., On the polynomial of a graph, Amer. Math. Monthly

1963

Earlier work this paper cites.

Seidel, J.J., Strongly regular graphs with ( − 1 , 1 , 0 ) (-1,1,0) adjacency matrix having eigenvalue 3, Linear Algebra Appl

1968

Earlier work this paper cites.

Laskar, R., Eigenvalues of the adjacency matrix of the cubic lattice graph, Pacific J. Math

1969

Earlier work this paper cites.

Cvetković, D.M., New characterizations of the cubic lattice graphs, Publ. Inst. Math. (Beograd)

1970

Earlier work this paper cites.

Newman, M., Integral Matrices

1972

Earlier work this paper cites.

Delsarte, P., An algebraic approach to the association schemes of coding theory, Philips Res. Reports Suppl

1973

Earlier work this paper cites.

Gardiner, A., Antipodal covering graphs, J. Combin. Theory Ser. B

1974

Earlier work this paper cites.

Delsarte, P., Goethals, J.-M., Alternating bilinear forms over G ​ F ​ ( q ) GF(q) , J. Combin. Theory Ser. A

1975

Earlier work this paper cites.

Wilson, R.M., An existence theory for pairwise balanced designs, III, Proof of the existence conjectures, J. Combin. Theory Ser. A

1975

Earlier work this paper cites.

Delsarte, P., Association schemes and t t -designs in regular semilattices, J. Combin. Theory Ser. A

1976

Earlier work this paper cites.

Dunkl, C.F., A Krawtchouk polynomial addition theorem and wreath products of symmetric groups, Indiana Univ. Math. J

1976

Earlier work this paper cites.

Ray-Chaudhuri, D.K., Sprague, A.P., Characterization of projective incidence structures, Geom. Dedicata

1976

Earlier work this paper cites.

Cameron, P.J., Goethals, J.-M., Seidel, J.J., The Krein condition, spherical designs, Norton algebras and permutation groups, Nederl. Akad. Wetensch. Indag. Math

1978

Earlier work this paper cites.

Cameron, P.J., Goethals, J.-M., Seidel, J.J., Strongly regular graphs having strongly regular subconstituents, J. Algebra

1978

Earlier work this paper cites.

Delsarte, P., Bilinear forms over a finite field with applications to coding theory, J. Combin. Theory Ser. A

1978

Earlier work this paper cites.

Dunkl, C.F., An addition theorem for Hahn polynomials: the spherical functions, SIAM J. Math. Anal

1978

Earlier work this paper cites.

Dunkl, C.F., An addition theorem for some q q -Hahn polynomials, Monatsh. Math

1978

Earlier work this paper cites.

McEliece, R.J., Rodemich, E.R., Rumsey, H.C., Jr., The Lovász bound and some generalizations, J. Combin. Inform. System Sci

1978

Earlier work this paper cites.

Dunkl, C.F., Orthogonal functions on some permutation groups, Relations Between Combinatorics and Other Parts of Mathematics

1979

Earlier work this paper cites.

Haemers, W.H., Eigenvalue techniques in design and graph theory

1979

Earlier work this paper cites.

Lovász, L., On the Shannon capacity of a graph, IEEE Trans. Inform. Theory

1979

Earlier work this paper cites.

Schrijver, A., A comparison of the Delsarte and Lovász bounds, IEEE Trans. Inform. Theory

1979

Earlier work this paper cites.

Cvetković, D., Doob, M., Sachs, H., Spectra of Graphs

1980

Earlier work this paper cites.

Godsil, C.D., McKay, B.D., Feasibility conditions for the existence of walk-regular graphs, Linear Algebra Appl

1980

Earlier work this paper cites.

Neumaier, A., Strongly regular graphs with smallest eigenvalue − m -m , Arch. Math

1980

Earlier work this paper cites.

Babai, L., On the order of uniprimitive permutation groups, Ann. of Math

1981

Earlier work this paper cites.

Bloom, G.S., Quintas, L.W., Kennedy, J.W., Distance degree regular graphs, The Theory and Applications of Graphs, Proceedings of the 4th international conference on the theory and applications of graphs, Kallamazoo, 1980

1981

Earlier work this paper cites.

Brouwer, A.E., The nonexistence of a regular near hexagon on 1408 1408 points, Math. Centr. Report

1981

Earlier work this paper cites.

Egawa, Y., Characterization of H ⁡ ( n , q ) H(n,q) by the parameters, J. Combin. Theory Ser. A

1981

Earlier work this paper cites.

Sprague, A.P., Incidence structures whose planes are nets, European J. Combin

1981

Earlier work this paper cites.

Stanton, D., Three addition theorems for some q q -Krawtchouk polynomials, Geom. Dedicata

1981

Earlier work this paper cites.

Moon, A., Characterization of the odd graphs O k O_{k} by parameters, Discrete Math

1982

Earlier work this paper cites.

Terwilliger, P., Eigenvalue multiplicities of highly symmetric graphs, Discrete Math

1982

Earlier work this paper cites.

Weichsel, P.M., On distance-regularity in graphs, J. Combin. Theory Ser. B

1982

Earlier work this paper cites.

Brouwer, A.E., On the uniqueness of a certain thin near octagon (or partial 2 2 -geometry, or parallelism) derived from the binary Golay code, IEEE Trans. Inform. Theory

1983

Earlier work this paper cites.

Brouwer, A.E., Wilbrink, H.A., The structure of near polygons with quads, Geom. Dedicata

1983

Earlier work this paper cites.

Chvátal, V., Mastermind, Combinatorica

1983

Earlier work this paper cites.

Ivanov, A.A., Bounding the diameter of a distance-regular graph, Dokl. Akad. Nauk SSSR

1983

Earlier work this paper cites.

Simon, H.-U., A tight Ω ⁡ ( log ⁡ log ⁡ n ) \Omega(\log\log n) -bound on the time for parallel RAMs to compute nondegenerated Boolean functions, Foundations of Computation Theory

1983

Earlier work this paper cites.

Terwilliger, P., Distance-regular graphs and ( s , c , a , k ) (s,c,a,k) -graphs, J. Combin. Theory Ser. B

1983

Earlier work this paper cites.

Bannai, E., Ito, T., Algebraic Combinatorics I: Association Schemes

1984

Earlier work this paper cites.

Doyle, P.G., Snell, J.L., Random Walks and Electric Networks

1984

Earlier work this paper cites.

Hemmeter, J., Halved graphs, Johnson and Hamming graphs, Utilitas Math

1984

Earlier work this paper cites.

Hilano, T., Nomura, K., Distance degree regular graphs, J. Combin. Theory Ser. B

1984

Earlier work this paper cites.

Van Slijpe, A.R.D., Random walks on regular polyhedra and other distance-regular graphs, Stat. Neerl

1984

Earlier work this paper cites.

Egawa, Y., Association schemes of quadratic forms, J. Combin. Theory Ser. A

1985

Earlier work this paper cites.

Mohar, B., Shawe-Taylor, J., Distance-biregular graphs with 2-valent vertices and distance-regular line graphs, J. Combin. Theory Ser. B

1985

Earlier work this paper cites.

Neumaier, A., Characterization of a class of distance regular graphs, J. Reine Angew. Math

1985

Earlier work this paper cites.

Stanton, D., Harmonics on posets, J. Combin. Theory Ser. A

1985

Earlier work this paper cites.

Terwilliger, P., Distance-regular graphs with girth 3 3 or 4 4 : I, J. Combin. Theory Ser. B

1985

Earlier work this paper cites.

Terwilliger, P., Counting 4 4 -vertex configurations in P P - and Q Q -polynomial association schemes, Algebras Groups Geom

1985

Earlier work this paper cites.

Biggs, N.L., Boshier, A.G., Shawe-Taylor, J., Cubic distance-regular graphs, J. London Math. Soc

1986

Earlier work this paper cites.

Brouwer, A.E., Cohen, A.M., Local recognition of Tits geometries of classical type, Geom. Dedicata

1986

Earlier work this paper cites.

Faradjev, I.A., Ivanov, A.A., Ivanov, A.V., Distance-transitive graphs of valency 5, 6 and 7, European J. Combin

1986

Earlier work this paper cites.

Hemmeter, J., Distance-regular graphs and halved graphs, European J. Combin

1986

Earlier work this paper cites.

Munemasa, A., An analogue of t t -designs in the association schemes of alternating bilinear forms, Graphs Combin

1986

Earlier work this paper cites.

Stanton, D., t t -Designs in classical association schemes, Graphs Combin

1986

Earlier work this paper cites.

Terwilliger, P., The Johnson graph J ⁡ ( d , r ) J(d,r) is unique if ( d , r ) ≠ ( 2 , 8 ) (d,r)\neq(2,8) , Discrete Math

1986

Earlier work this paper cites.

Terwilliger, P., A class of distance-regular graphs that are Q Q -polynomial, J. Combin. Theory Ser. B

1986

Earlier work this paper cites.

Bannai, E., Ito, T., On distance-regular graphs with fixed valency, Graphs Combin

1987

Earlier work this paper cites.

Bier, T., A family of nonbinary linear codes, Discrete Math

1987

Earlier work this paper cites.

Chihara, L., On the zeros of the Askey-Wilson polynomials, with applications to coding theory, SIAM J. Math. Anal

1987

Earlier work this paper cites.

Diaconis, P., Shahshahani, M., Time to reach stationarity in the Bernoulli-Laplace diffusion model, SIAM J. Math. Anal

1987

Earlier work this paper cites.

Fuglister, F.J., On generalized Moore geometries I, II, Discrete Math

1987

Earlier work this paper cites.

Godsil, C.D., Shawe-Taylor, J., Distance-reguralised graphs are distance-regular or distance-biregular, J. Combin. Theory Ser. B

1987

Earlier work this paper cites.

Huang, T., A characterization of the association schemes of bilinear forms, European J. Combin

1987

Earlier work this paper cites.

Teirlinck, L., Nontrivial t t -designs without repeated blocks exist for all t t , Discrete Math

1987

Earlier work this paper cites.

Terwilliger, P., Root systems and the Johnson and Hamming graphs, European J. Combin

1987

Earlier work this paper cites.

Terwilliger, P., A characterization of P P - and Q Q -polynomial association schemes, J. Combin. Theory Ser. A

1987

Earlier work this paper cites.

Terwilliger, P., P P and Q Q polynomial schemes with q = − 1 q=-1 , J. Combin. Theory Ser. B

1987

Earlier work this paper cites.

Van Bon, J.T.M., Brouwer, A.E., The distance-regular antipodal covers of classical distance-regular graphs, Combinatorics

1988

Earlier work this paper cites.

Brouwer, A.E., Neumaier, A., A remark on partial linear spaces of girth 5 with an application to strongly regular graphs, Combinatorica

1988

Earlier work this paper cites.

Godsil, C.D., Bounding the diameter of distance-regular graphs, Combinatorica

1988

Earlier work this paper cites.

Hemmeter, J., The large cliques in the graph of quadratic forms, European J. Combin

1988

Earlier work this paper cites.

Powers, D.L., Eigenvectors of distance-regular graphs, SIAM J. Matrix Anal. Appl

1988

Earlier work this paper cites.

Powers, D.L., Semiregular graphs and their algebra, Linear Multilinear Algebra

1988

Earlier work this paper cites.

Terwilliger, P., The classification of distance-regular graphs of type IIB, Combinatorica

1988

Earlier work this paper cites.

Terwilliger, P., Balanced sets and Q Q -polynomial association schemes, Graphs Combin

1988

Earlier work this paper cites.

Bannai, E., Ito, T., On distance-regular graphs with fixed valency, IV, European J. Combin

1989

Earlier work this paper cites.

Brouwer, A.E., Cohen, A.M., Neumaier, A., Distance-Regular Graphs

1989

Earlier work this paper cites.

Ivanov, A.A., Muzichuk, M.E., Ustimenko, V.A., On a new family of ( P P and Q Q )-polynomial schemes, European J. Combin

1989

Earlier work this paper cites.

Jones, V.F.R., On knot invariants related to some statistical mechanical models, Pacific J. Math

1989

Earlier work this paper cites.

Zhu, R.R., Distance-regular graphs and eigenvalue multiplicities

1989

Earlier work this paper cites.

Brouwer, A.E., The Soicher graph - an antipodal 3 3 -cover of the second subconstituent of the McLaughlin graph, manuscript (1990)

1990

Earlier work this paper cites.

Brouwer, A.E., A note on completely regular codes, Discrete Math

1990

Earlier work this paper cites.

Devroye, L., Sbihi, A., Random walks on highly symmetric graphs, J. Theoret. Probab

1990

Earlier work this paper cites.

Hemmeter, J., Woldar, A., On the maximal cliques of the quadratic forms graph in even characteristic, European J. Combin

1990

Earlier work this paper cites.

Hemmeter, J., Woldar, A., Classification of the maximal cliques of size ≥ q + 4 \geq q+4 in the quadratic forms graph in odd characteristic, European J. Combin

1990

Earlier work this paper cites.

Ivanov, A.A., Shpectorov, S.V., The P P -geometry for M 23 M_{23} has no non-trivial 2-coverings, European J. Combin

1990

Earlier work this paper cites.

Lambeck, E.W., Contributions to the theory of distance regular graphs

1990

Earlier work this paper cites.

Lee, J., A spectral approach to polyhedral dimension, Math. Program

1990

Earlier work this paper cites.

Lee, J., Characterizations of the dimension for classes of concordant polytopes, Math. Oper. Res

1990

Earlier work this paper cites.

Neumaier, A., Krein conditions and near polygons, J. Combin. Theory Ser. A

1990

Earlier work this paper cites.

Nomura, K., Distance-regular graphs of Hamming type, J. Combin. Theory Ser. B

1990

Earlier work this paper cites.

Rifà, J., Huguet, L., Classification of a class of distance-regular graphs via completely regular codes, Discrete Appl. Math

1990

Earlier work this paper cites.

Solé, P., Completely regular codes and completely transitive codes, Discrete Math

1990

Earlier work this paper cites.

Terwilliger, P., The incidence algebra of a uniform poset, Coding Theory and Design Theory, Part I

1990

Earlier work this paper cites.

Chari, V., Pressley, A., Quantum affine algebras, Comm. Math. Phys

1991

Earlier work this paper cites.

Ivanov, A.A., Shpectorov, S.V., A characterization of the association schemes of Hermitian forms, J. Math. Soc. Japan

1991

Earlier work this paper cites.

Lovász, L., Schrijver, A., Cones of matrices and set-functions and 0 0 - 1 1 optimization, SIAM J. Optim

1991

Earlier work this paper cites.

Meixner, T., Some polar towers, European J. Combin

1991

Earlier work this paper cites.

Metsch, K., Improvement of Bruck’s completion theorem, Des. Codes Cryptogr

1991

Earlier work this paper cites.

Suzuki, H., Bounding the diameter of a distance regular graph by a function of k d k_{d} , Graphs Combin

1991

Earlier work this paper cites.

Brouwer, A.E., Hemmeter, J., A new family of distance-regular graphs and the { 0 , 1 , 2 } \{0,1,2\} -cliques in dual polar graphs, European J. Combin

1992

Earlier work this paper cites.

Bussemaker, F.C., Neumaier, A., Exceptional graphs with smallest eigenvalue − 2 -2 and related problems, Math. Comp

1992

Earlier work this paper cites.

Cuypers, H., The dual of Pasch’s axiom, European J. Combin

1992

Earlier work this paper cites.

Godsil, C.D., Krein covers of complete graphs, Australas. J. Combin

1992

Earlier work this paper cites.

Godsil, C.D., Hensel, A.D., Distance regular covers of the complete graph, J. Combin. Theory Ser. B

1992

Earlier work this paper cites.

Ito, T., Terwilliger, P., Distance-regular graphs of q q -Racah type and the q q -tetrahedron algebra, Michigan Math. J

Original

1992

Earlier work this paper cites.

Koolen, J.H., On subgraphs in distance-regular graphs, J. Algebraic Combin

1992

Earlier work this paper cites.

Koolen, J.H., A new condition for distance-regular graphs, European J. Combin

1992

Earlier work this paper cites.

Martin, W.J., Completely regular subsets

1992

Earlier work this paper cites.

Meyerowitz, A., Cycle-balanced partitions in distance-regular graphs, J. Combin. Inform. System Sci

1992

Earlier work this paper cites.

Neumaier, A., Completely regular codes, Discrete Math

1992

Earlier work this paper cites.

Biggs, N., Algebraic Graph Theory

1993

Earlier work this paper cites.

Brouwer, A.E., On complete regularity of extended codes, Discrete Math

1993

Earlier work this paper cites.

Brouwer, A.E., Haemers, W.H., The Gewirtz graph: An exercise in the theory of graph spectra, European J. Combin

1993

Earlier work this paper cites.

Fon-Der-Flaass, D.G., There exists no distance-regular graph with intersection array ( 5 , 4 , 3 , 1 , 1 , 2 ) (5,4,3;1,1,2) , European J. Combin

1993

Earlier work this paper cites.

Fon-Der-Flaass, D.G., A distance-regular graph with intersection array ( 5 , 4 , 3 , 3 , 1 , 1 , 1 , 2 ) (5,4,3,3;\penalty 1,1,1,2) does not exist, J. Algebraic Combin

1993

Earlier work this paper cites.

Godsil, C.D., Algebraic Combinatorics

1993

Earlier work this paper cites.

Godsil, C.D., Geometric distance-regular covers, New Zealand J. Math

1993

Earlier work this paper cites.

Koolen, J.H., On uniformly geodetic graphs, Graphs Combin

1993

Earlier work this paper cites.

Lakshmivarahan, S., Jwo, J.-S., Dhall, S.K., Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey, Parallel Comput

1993

Earlier work this paper cites.

Lambeck, E., Some elementary inequalities for distance-regular graphs, European J. Combin

1993

Earlier work this paper cites.

Munemasa, A., Pasechnik, D.V., Shpectorov, S.V., The automorphism group and the convex subgraphs of the quadratic forms graph in characteristic 2 2 , J. Algebraic Combin

1993

Earlier work this paper cites.

Soicher, L.H., Three new distance-regular graphs, European J. Combin

1993

Earlier work this paper cites.

Terwilliger, P., The subconstituent algebra of an association scheme, I, J. Algebraic Combin

1993

Earlier work this paper cites.

Terwilliger, P., P P - and Q Q -polynomial association schemes and their antipodal P P -polynomial covers, European J. Combin

1993

Earlier work this paper cites.

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

1993

Earlier work this paper cites.

Zhu, R.R., Distance-regular graphs with an eigenvalue of multiplicity four, J. Combin. Theory Ser. B

1993

Earlier work this paper cites.

Faradžev, I.A., Klin, M.H., Muzichuk, M.E., Cellular rings and groups of automorphisms of graphs, Investigations in Algebraic Theory of Combinatorial Objects

1994

Earlier work this paper cites.

Hiraki, A., An improvement of the Boshier-Nomura bound, J. Combin. Theory Ser. B

1994

Earlier work this paper cites.

Ivanov, A.A., Distance-transitive graphs and their classification, Investigations in Algebraic Theory of Combinatorial Objects

1994

Earlier work this paper cites.

Jwo, J.-S., Tuan, T.-C., On transmitting delay in a distance-transitive strongly antipodal graph, Inform. Process. Lett

1994

Earlier work this paper cites.

Koolen, J.H., Euclidean representations and substructures of distance-regular graphs

1994

Earlier work this paper cites.

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

1994

Earlier work this paper cites.

Koolen, J.H., Shpectorov, S.V., Distance-regular graphs the distance matrix of which has only one positive eigenvalue, European J. Combin

1994

Earlier work this paper cites.

Ma, S.L., A survey of partial difference sets, Des. Codes Cryptogr

1994

Earlier work this paper cites.

Martin, W.J., Completely regular designs of strength one, J. Algebraic Combin

1994

Earlier work this paper cites.

Nomura, K., Homogeneous graphs and regular near polygons, J. Combin. Theory Ser. B

1994

Earlier work this paper cites.

Suzuki, H., On distance-regular graphs with k i = k j k_{i}=k_{j} , J. Combin. Theory Ser. B

1994

Earlier work this paper cites.

Suzuki, H., Bounding the diameter of a distance regular graph by a function of k d k_{d} , II, J. Algebra

1994

Earlier work this paper cites.

Tomiyama, M., Yamazaki, N., The subconstituent algebra of a strongly regular graph, Kyushu J. Math

1994

Earlier work this paper cites.

Wajima, M., A remark on distance-regular graphs with a circuit of diameter t + 1 t+1 , Math. Japon

1994

Earlier work this paper cites.

Brouwer, A.E., Haemers, W.H., Association schemes, Handbook of Combinatorics

1995

Earlier work this paper cites.

Brouwer, A.E., Hemmeter, J., Woldar, A., The complete list of maximal cliques of Quad ⁡ ( n , q ) \mathrm{Quad}(n,q) , q q odd, European J. Combin

1995

Earlier work this paper cites.

De Caen, D., Mathon, R., Moorhouse, G.E., A family of antipodal distance-regular graphs related to the classical Preparata codes, J. Algebraic Combin

1995

Earlier work this paper cites.

Chihara, L., Stanton, D., A matrix equation for association schemes, Graphs Combin

1995

Earlier work this paper cites.

Coolsaet, K., Local structure of graphs with λ = μ = 2 , \lambda=\mu=2, a 2 = 4 a_{2}=4 , Combinatorica

1995

Earlier work this paper cites.

Dickie, G.A., Q Q -polynomial structures for association schemes and distance-regular graphs

1995

Earlier work this paper cites.

Feige, U., A tight lower bound on the cover time for random walks on graphs, Random Struct. Algorithms

1995

Earlier work this paper cites.

Godsil, C.D., Koolen, J.H., On the multiplicity of eigenvalues of distance-regular graphs, Linear Algebra Appl

1995

Earlier work this paper cites.

Haemers, W.H., Interlacing eigenvalues and graphs, Linear Algebra Appl

1995

Earlier work this paper cites.

Haemers, W.H., Spence, E., Graphs cospectral with distance-regular graphs, Linear Multilinear Algebra

1995

Earlier work this paper cites.

Hiraki, A., Distance-regular subgraphs in a distance-regular graph, I, II, European J. Combin

1995

Earlier work this paper cites.

Hiraki, A., Suzuki, H., Wajima, M., On distance-regular graphs with k i = k j k_{i}=k_{j} , II, Graphs Combin

1995

Earlier work this paper cites.

Koolen, J.H., A characterization of the Doob graphs, J. Combin. Theory Ser. B

1995

Earlier work this paper cites.

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, Linear Multilinear Algebra

1995

Earlier work this paper cites.

Martin, W.J., Zhu, X.J., Anticodes for the Grassmann and bilinear forms graphs, Des. Codes Cryptogr

1995

Earlier work this paper cites.

Metsch, K., A characterization of Grassmann graphs, European J. Combin

1995

Earlier work this paper cites.

Nomura, K., Spin models on bipartite distance-regular graphs, J. Combin. Theory Ser. B

1995

Earlier work this paper cites.

Soicher, L.H., Yet another distance-regular graph related to a Golay code, Electron. J. Combin

1995

Earlier work this paper cites.

Suzuki, H., Distance-semiregular graphs, Algebra Colloq

1995

Earlier work this paper cites.

Suzuki, H., On strongly closed subgraphs of highly regular graphs, European J. Combin

1995

Earlier work this paper cites.

Terwilliger, P., Kite-free distance-regular graphs, European J. Combin

1995

Earlier work this paper cites.

Terwilliger, P., A new inequality for distance-regular graphs, Discrete Math

1995

Earlier work this paper cites.

Weng, C.-W., Kite-free P P - and Q Q -polynomial schemes, Graphs Combin

1995

Earlier work this paper cites.

Yamazaki, N., Distance-regular graphs with Γ ⁡ ( x ) ≃ 3 ∗ K a + 1 \Gamma(x)\simeq 3*K_{a+1} , European J. Combin

1995

Earlier work this paper cites.

Araya, M., Hiraki, A., Jurišić, A., Distance-regular graphs with b t = 1 b_{t}=1 and antipodal double-covers, J. Combin. Theory Ser. B

1996

Earlier work this paper cites.

Biggs, N., Chip firing on distance-regular graphs, CDAM Research Report Series

1996

Earlier work this paper cites.

Chandra, A.K., Raghavan, P., Ruzzo, W.L., Smolensky, R., Tiwari, P., The electrical resistance of a graph captures its commute and cover times, Comput. Complexity

1996

Earlier work this paper cites.

Dickie, G.A., Terwilliger, P., Dual bipartite Q Q -polynomial distance-regular graphs, European J. Combin

1996

Earlier work this paper cites.

Etzion, T., Bitan, S., On the chromatic number, colorings, and codes of the Johnson graph, Discrete Appl. Math

1996

Earlier work this paper cites.

Fiol, M.A., Garriga, E., Yebra, J.L.A., Locally pseudo-distance-regular graphs, J. Combin. Theory Ser. B

1996

Earlier work this paper cites.

Godsil, C.D., Covers of complete graphs, Progress in Algebraic Combinatorics

1996

Earlier work this paper cites.

Haemers, W.H., Distance-regularity and the spectrum of graphs, Linear Algebra Appl

1996

Earlier work this paper cites.

Hiraki, A., Distance-regular subgraphs in a distance-regular graph, III, European J. Combin

1996

Earlier work this paper cites.

Jaeger, F., Towards a classification of spin models in terms of association schemes, Progress in Algebraic Combinatorics

1996

Earlier work this paper cites.

Martin, W.J., Zhu, R.R., Distance-regular graphs having an eigenvalue of small multiplicity, Univ. Waterloo Res. Rep

1996

Earlier work this paper cites.

Nomura, K., Spin models and almost bipartite 2 2 -homogeneous graphs, Progress in Algebraic Combinatorics

1996

Earlier work this paper cites.

Suzuki, H., Strongly closed subgraphs of a distance-regular graph with geometric girth five, Kyushu J. Math

1996

Earlier work this paper cites.

Suzuki, H., A note on association schemes with two P P -polynomial structures of Type III, J. Combin. Theory Ser. A

1996

Earlier work this paper cites.

Terwilliger, P., Quantum matroids, Progress in Algebraic Combinatorics

1996

Earlier work this paper cites.

Tomiyama, M., On distance-regular graphs with height two, J. Algebraic Combin

1996

Earlier work this paper cites.

Yamazaki, N., Bipartite distance-regular graphs with an eigenvalue of multiplicity k k , J. Combin. Theory Ser. B

1996

Earlier work this paper cites.

Araya, M., Hiraki, A., Jurišić, A., Distance-regular graphs with b 2 = 1 b_{2}=1 and antipodal covers, European J. Combin

1997

Earlier work this paper cites.

Biggs, N.L., Potential theory on distance-regular graphs, Comb. Probab. Comput

1997

Earlier work this paper cites.

Biggs, N., Algebraic potential theory on graphs, Bull. London Math. Soc

1997

Earlier work this paper cites.

Blokhuis, A., Brouwer, A.E., Determination of the distance-regular graphs without 3 3 -claws, Discrete Math

1997

Earlier work this paper cites.

Caughman IV, J.S., Intersection numbers of bipartite distance-regular graphs, Discrete Math

1997

Earlier work this paper cites.

Collins, B.V.C., The girth of a thin distance-regular graph, Graphs Combin

1997

Earlier work this paper cites.

Van Dam, E.R., Haemers, W.H., A characterization of distance-regular graphs with diameter three, J. Algebraic Combin

1997

Earlier work this paper cites.

Driscoll, J.R., Healy Jr., D.M., Rockmore, D.N., Fast discrete polynomial transforms with applications to data analysis for distance transitive graphs, SIAM J. Comput

1997

Earlier work this paper cites.

Fiol, M.A., An eigenvalue characterization of antipodal distance-regular graphs, Electron. J. Combin

1997

Earlier work this paper cites.

Fiol, M.A., Garriga, E., From local adjacency polynomials to locally pseudo-distance-regular graphs, J. Combin. Theory Ser. B

1997

Earlier work this paper cites.

Godsil, C.D., Praeger, C.E., Completely transitive designs, manuscript (1997); arXiv:1405.2176

Original

1997

Earlier work this paper cites.

Hiraki, A., Distance-regular subgraphs in a distance-regular graph, IV, European J. Combin

1997

Earlier work this paper cites.

Ivanov, A.A., Liebler, R.A., Penttila, T., Praeger, C.E., Antipodal distance-transitive covers of complete bipartite graphs, European J. Combin

1997

Earlier work this paper cites.

Liang, Y., Weng, C., Parallelogram-free distance-regular graphs, J. Combin. Theory Ser. B

1997

Earlier work this paper cites.

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

1997

Earlier work this paper cites.

Metsch, K., On the characterization of the folded Johnson graphs and the folded halved cubes by their intersection arrays, European J. Combin

1997

Earlier work this paper cites.

Metsch, K., Characterization of the folded Johnson graphs of small diameter by their intersection arrays, European J. Combin

1997

Earlier work this paper cites.

Nomura, K., An algebra associated with a spin model, J. Algebraic Combin

1997

Earlier work this paper cites.

Rowlinson, P., Linear algebra, Graph Connections

1997

Earlier work this paper cites.

Tanabe, K., The irreducible modules of the Terwilliger algebras of Doob schemes, J. Algebraic Combin

1997

Earlier work this paper cites.

Weng, C., D D -bounded distance-regular graphs, European J. Combin

1997

Earlier work this paper cites.

Araya, M., Hiraki, A., Distance-regular graphs with c i = b d − i c_{i}=b_{d-i} and antipodal double covers, J. Algebraic Combin

1998

Earlier work this paper cites.

Belsley, E.D., Rates of convergence of random walk on distance regular graphs, Probab. Theory Related Fields

1998

Earlier work this paper cites.

Bending, T.D., Fon-Der-Flaass, D., Crooked functions, bent functions, and distance regular graphs, Electron. J. Combin

1998

Earlier work this paper cites.

Brouwer, A.E., Koolen, J.H., Riebeek, R.J., A new distance-regular graph associated to the Mathieu group M 10 M_{10} , J. Algebraic Combin

1998

Earlier work this paper cites.

Caughman IV, J.S., Spectra of bipartite P P - and Q Q -polynomial association schemes, Graphs Combin

1998

Earlier work this paper cites.

Chen, Y., Hiraki, A., Koolen, J.H., On distance-regular graphs with c 4 = 1 c_{4}=1 and a 1 ≠ a 2 a_{1}\neq a_{2} , Kyushu J. Math

1998

Earlier work this paper cites.

Curtin, B., 2 2 -Homogeneous bipartite distance-regular graphs, Discrete Math

1998

Earlier work this paper cites.

Delsarte, P., Levenshtein, V.I., Association schemes and coding theory, IEEE Trans. Inform. Theory

1998

Earlier work this paper cites.

Dickie, G.A., Terwilliger, P., A note on thin P P -polynomial and dual-thin Q Q -polynomial symmetric association schemes, J. Algebraic Combin

1998

Earlier work this paper cites.

Godsil, C.D., Eigenpolytopes of distance regular graphs, Canad. J. Math

1998

Cited alongside, same era.

Godsil, C.D., Liebler, R.A., Praeger, C.E., Antipodal distance transitive covers of complete graphs, European J. Combin

1998

Cited alongside, same era.

Hiraki, A., Distance-regular subgraphs in a distance-regular graph, V, European J. Combin

1998

Cited alongside, same era.

Hiraki, A., Distance-regular subgraphs in a distance-regular graph, VI, European J. Combin

1998

Cited alongside, same era.

Hiraki, A., Koolen, J., An improvement of the Ivanov bound, Ann. Comb

1998

Cited alongside, same era.

Hobart, S., Ito, T., The structure of nonthin irreducible T T -modules of endpoint 1 1 : ladder bases and classical parameters, J. Algebraic Combin

Pan, Y., Weng, C., 3 3 -Bounded property in a triangle-free distance-regular graph, European J. Combin

Original

2008

Later among the works it cites.

Pascasio, A.A., A characterization of Q Q -polynomial distance-regular graphs, Discrete Math

2008

Later among the works it cites.

Salimi, S., Quantum central limit theorem for continuous-time quantum walks on Odd graphs in quantum probability theory, Int. J. Theor. Phys

Original

2008

Later among the works it cites.

Suzuki, H., Almost 2 2 -homogeneous graphs and completely regular quadrangles, Graphs Combin

2008

Later among the works it cites.

Vallentin, F., Optimal distortion embeddings of distance regular graphs into Euclidean spaces, J. Combin. Theory Ser. B

2008

Later among the works it cites.