The following pages link to Distance-regular graphs (Q281530):
Displaying 50 items.
- On bipartite \(Q\)-polynomial distance-regular graphs with \(c_2 \leqslant 2\) (Q490271) (← links)
- On Lee association schemes over \(\mathbb{Z}_4\) and their Terwilliger algebra (Q501247) (← links)
- Nonsymmetric Askey-Wilson polynomials and \(Q\)-polynomial distance-regular graphs (Q501689) (← links)
- On the metric dimension of imprimitive distance-regular graphs (Q505687) (← links)
- An application of Hoffman graphs for spectral characterizations of graphs (Q510321) (← links)
- Max-cut and extendability of matchings in distance-regular graphs (Q518196) (← links)
- Some spectral and quasi-spectral characterizations of distance-regular graphs (Q530763) (← links)
- On the 486-vertex distance-regular graphs of Koolen-Riebeek and Soicher (Q783063) (← links)
- Some results on the eigenvalues of distance-regular graphs (Q897242) (← links)
- On relative \(t\)-designs in polynomial association schemes (Q907238) (← links)
- A spectral characterization of the \(s\)-clique extension of the square grid graphs (Q1633608) (← links)
- New strongly regular graphs from orthogonal groups \(O^+(6, 2)\) and \(O^-(6, 2)\) (Q1660252) (← links)
- A valency bound for distance-regular graphs (Q1689048) (← links)
- A new characterization of the dual polar graphs (Q1719579) (← links)
- Generalized quasispecies model on finite metric spaces: isometry groups and spectral properties of evolutionary matrices (Q1731939) (← links)
- On the metric dimension of incidence graphs (Q1744744) (← links)
- Partially metric association schemes with a multiplicity three (Q1745731) (← links)
- On bipartite \(Q\)-polynomial distance-regular graphs with diameter 9, 10, or 11 (Q1753018) (← links)
- Completely regular codes by concatenating Hamming codes (Q1783729) (← links)
- Speeding up finite-time consensus via minimal polynomial of a weighted graph -- a numerical approach (Q1797040) (← links)
- A characterization of Johnson and Hamming graphs and proof of Babai's conjecture (Q1984524) (← links)
- Using symbolic computation to prove nonexistence of distance-regular graphs (Q1991433) (← links)
- Distance regular graphs arising from dimensional dual hyperovals (Q1995211) (← links)
- Non-bipartite distance-regular graphs with a small smallest eigenvalue (Q2001973) (← links)
- Leonard pairs, spin models, and distance-regular graphs (Q2005192) (← links)
- Connectivity concerning the last two subconstituents of a \(Q\)-polynomial distance-regular graph (Q2005196) (← links)
- Scaffolds: a graph-theoretic tool for tensor computations related to Bose-Mesner algebras (Q2020658) (← links)
- On some recent progress in the classification of (\(P\) and \(Q\))-polynomial association schemes (Q2023761) (← links)
- Norton algebras of the Hamming graphs via linear characters (Q2030754) (← links)
- On the spectral gap and the automorphism group of distance-regular graphs (Q2033919) (← links)
- The Norton algebra of a \(Q\)-polynomial distance-regular graph (Q2037186) (← links)
- Recent progress on graphs with fixed smallest adjacency eigenvalue: a survey (Q2042199) (← links)
- A proof of a dodecahedron conjecture for distance sets (Q2051877) (← links)
- Scaling limits for the Gibbs states on distance-regular graphs with classical parameters (Q2064893) (← links)
- On the distance spectrum of minimal cages and associated distance biregular graphs (Q2069865) (← links)
- Thin \(Q\)-polynomial distance-regular graphs have bounded \(c_2\) (Q2093103) (← links)
- Spatial search on Johnson graphs by continuous-time quantum walk (Q2102297) (← links)
- The average search probabilities of discrete-time quantum walks (Q2104770) (← links)
- On (almost) \(2\)-\(Y\)-homogeneous distance-biregular graphs (Q2111894) (← links)
- Thick weakly distance-regular digraphs (Q2115150) (← links)
- Non-bipartite distance-regular graphs with diameters 5, 6 and a smallest eigenvalue (Q2117517) (← links)
- Thin distance-regular graphs with classical parameters \((D, q, q, \frac{q^t-1}{q-1}-1)\) with \(t> D\) are the Grassmann graphs (Q2121737) (← links)
- Weakly distance-regular digraphs of one type of arcs (Q2135542) (← links)
- Eigenvalues of Cayley graphs (Q2138565) (← links)
- On bipartite distance-regular Cayley graphs with small diameter (Q2138568) (← links)
- On the spectrum and linear programming bound for hypergraphs (Q2143404) (← links)
- On distance-regular Cayley graphs of generalized dicyclic groups (Q2144580) (← links)
- Remarks on pseudo-vertex-transitive graphs with small diameter (Q2144586) (← links)
- On bounding the diameter of a distance-regular graph (Q2151185) (← links)
- On the 2-\(Y\)-homogeneous condition of the incidence graphs of 2-designs (Q2157840) (← links)
