Distance-regular graphs
arXiv:1410.6294 · doi:10.37236/4925
Abstract
This is a survey of distance-regular graphs. We present an introduction to distance-regular graphs for the reader who is unfamiliar with the subject, and then give an overview of some developments in the area of distance-regular graphs since the monograph 'BCN' [Brouwer, A.E., Cohen, A.M., Neumaier, A., Distance-Regular Graphs, Springer-Verlag, Berlin, 1989] was written.
156 pages
References in corpus (42)
- The existence of designs
- New upper bounds for kissing numbers from semidefinite programming
- Quantum Random Walks Hit Exponentially Faster
- Separation cut-offs for birth and death chains
- Perfect state transfer on distance-regular graphs and association schemes
- On almost distance-regular graphs
- Matrix Algebras and Semidefinite Programming Techniques for Codes
- Perfect state transfer over distance-regular spin networks
- On semidefinite programming relaxations of the traveling salesman problem
- Some algebra related to -and -polynomial association schemes
- A new family of tight sets in
- Investigation of Continuous-Time Quantum Walk Via Modules of Bose-Mesner and Terwilliger Algebras
- Quantum central limit theorem for continuous-time quantum walks on odd graphs in quantum probability theory
- The Drinfel'd polynomial of a tridiagonal pair
- Dual polar graphs, the quantum algebra U_q(sl_2), and Leonard systems of dual q-Krawtchouk type
- Nonexistence of exceptional imprimitive Q-polynomial association schemes with six classes
- On perturbations of almost distance-regular graphs
- Dual concepts of almost distance-regularity and the spectral excess theorem
- The Laplacian spectral excess theorem for distance-regular graphs
- Some Spectral and Quasi-Spectral Characterizations of Distance-Regular Graphs
- Classification of a family of completely transitive codes
- Hypercubes, Leonard triples and the anticommutator spin algebra
- Large connected strongly regular graphs are Hamiltonian
- Distance-regular graph with large a1 or c2
- A note on the span of Hadamard products of vectors
- There are only finitely many distance-regular graphs with valency k at least three, fixed ratio k2/k and large diameter
- Distance-regular graphs with valency k having smallest eigenvalue at most -k/2
- The endomorphism of Grassmann graphs
- Completely Transitive Designs
- New parameters of subsets in polynomial schemes
- Cameron-Liebler line classes with parameter
- The uniqueness of a distance-regular graph with intersection array {32,27,8,1;1,4,27,32} and related results
- A characterization of the graphs of bilinear -forms over
- Twice -polynomial distance-regular graphs of diameter 4
- Recursive calculation of effective resistances in distance-regular networks based on Bose-Mesner algebra and Christoffel-Darboux identity
- On the local spectra of the subconstituents of a vertex set and completely pseudo-regular codes
- Two characterizations of crooked functions
- On a Koolen -- Park inequality and Terwilliger graphs
- The displacement and split decompositions for a -polynomial distance-regular graph
- A spectral characterization of strongly distance-regular graphs with diameter four
- A note on Cameron - Liebler line classes in PG(n,4)
- An odd characterization of the generalized odd graphs
Cited by in corpus (39)
- Eigenvalues of Cayley graphs
- Spatial Search on Johnson Graphs by Continuous-Time Quantum Walk
- Max-cut and extendability of matchings in distance-regular graphs
- Strongly walk-regular graphs
- Entanglement of Free Fermions on Hadamard Graphs
- Dual Polar Graphs, a nil-DAHA of Rank One, and Non-Symmetric Dual q-Krawtchouk Polynomials
- Distance-regular Cayley graphs with least eigenvalue
- A compact presentation for the alternating central extension of the positive part of
- Nonsymmetric Askey-Wilson polynomials and -polynomial distance-regular graphs
- A characterization of Johnson and Hamming graphs and proof of Babai's conjecture
- Godsil-McKay switching and twisted Grassmann graphs
- Some Spectral and Quasi-Spectral Characterizations of Distance-Regular Graphs
- The Terwilliger algebra of the twisted Grassmann graph: the thin case
- Remarks on pseudo-vertex-transitive graphs with small diameter
- Multimarked Spatial Search by Continuous-Time Quantum Walk
- On the spectrum and linear programming bound for hypergraphs
- Distance-regular graphs with valency k having smallest eigenvalue at most -k/2
- A characterization of the graphs of bilinear -forms over
- Scaling Limits for the Gibbs States on Distance-Regular Graphs with Classical Parameters
- The uniqueness of a distance-regular graph with intersection array {32,27,8,1;1,4,27,32} and related results
- Grassmann graphs, degenerate DAHA, and non-symmetric dual -Hahn polynomials
- Thick weakly distance-regular digraphs
- Characterizing graphs with fully positive semidefinite -matrices
- Equivalent characterizations of the spectra of graphs and applications to measures of distance-regularity
- Tight relative -designs on two shells in hypercubes, and Hahn and Hermite polynomials
- Nonassociativity of the Norton Algebras of some distance regular graphs
- A spectral characterization of the s-clique extension of the square grid graphs
- On the coset graph construction of distance-regular graphs
- Twice -polynomial distance-regular graphs of diameter 4
- Speeding up finite-time consensus via minimal polynomial of a weighted graph - a numerical approach
- On the spectrum of two families of non-distance-regular graphs
- The super-connectivity of Johnson graphs
- Spectra of strongly Deza graphs
- A spectral characterization of the -clique extension of the triangular graphs
- Primitive weakly distance-regular circulant digraphs
- A characterization of 2-neighborhood degree list of diameter 2 graphs
- On completely regular and completely transitive codes derived from Hamming codes
- On the automorphism groups of distance-regular graphs and rank-4 primitive coherent configurations
- On the Cheeger constant for distance-regular graphs