The following pages link to Distance-regular graphs (Q3992965):
Displaying 50 items.
- Imprimitive distance-transitive graphs with primitive core of diameter at least 3 (Q1024870) (← links)
- Variance and concurrence in block designs, and distance in the corresponding graphs (Q1024872) (← links)
- Distance-regular graphs of \(q\)-Racah type and the \(q\)-tetrahedron algebra (Q1024879) (← links)
- Higmanian rank-5 association schemes on 40 points (Q1024880) (← links)
- On generalised Paley graphs and their automorphism groups (Q1024883) (← links)
- A construction of the sporadic Suzuki graph from \(U_3(4)\) (Q1024992) (← links)
- Graphs, designs and codes related to the \(n\)-cube (Q1025949) (← links)
- Claw finding algorithms using quantum walk (Q1034536) (← links)
- A survey on spherical designs and algebraic combinatorics on spheres (Q1039420) (← links)
- Permutation group approach to association schemes (Q1039422) (← links)
- Commutative association schemes (Q1039424) (← links)
- Schur rings. (Q1039425) (← links)
- Distance-transitive graphs admit semiregular automorphisms (Q1041179) (← links)
- Association schemes based on attenuated spaces (Q1041204) (← links)
- Distance-regular graph with \(c_{2} > 1\) and \(a_{1} = 0 < a_{2}\) (Q1043794) (← links)
- Parallelogram-free distance-regular graphs having completely regular strongly regular subgraphs (Q1043847) (← links)
- Asymptotic results on the spectral radius and the diameter of graphs (Q1044563) (← links)
- Regular partitions of dual polar spaces (Q1044565) (← links)
- Eigenvalues and edge-connectivity of regular graphs (Q1044623) (← links)
- Distance monotonicity and a new characterization of Hamming graphs (Q1044739) (← links)
- On a class of binary linear completely transitive codes with arbitrary covering radius (Q1044974) (← links)
- A generalization of dual polar graph of orthogonal space (Q1046465) (← links)
- On the coverings of the Higman-Sims graph and their automorphisms (Q1048487) (← links)
- Geodesic graphs with homogeneity conditions (Q1048508) (← links)
- On graphs in which the neighborhood of each vertex is isomorphic to the Hoffman-Singleton graph (Q1048517) (← links)
- On distance-regular graphs in which the neighborhood of each vertex is isomorphic to the Hoffman-Singleton graph (Q1048534) (← links)
- On graphs in which the neighborhood of each vertex is isomorphic to the Gewirtz graph (Q1048540) (← links)
- Distance degree regular graphs (Q1059640) (← links)
- On local structure of a distance-regular graph of Hamming type (Q1092930) (← links)
- Characterization of the association schemes of Hermitian forms over \(GF(2^ 2)\) (Q1122582) (← links)
- On graphs with multiple eigenvalues (Q1124744) (← links)
- Feasibility conditions for non-symmetric 3-class association schemes (Q1126187) (← links)
- Partitions in matrices and graphs (Q1176030) (← links)
- Splitting fields of association schemes (Q1176385) (← links)
- On pseudo-automorphisms and fusions of an association scheme (Q1178035) (← links)
- The \((\Delta{} , d, d', \Delta{} - 1)\)-problem with applications to computer networks (Q1179732) (← links)
- Bounding the diameter of a distance regular graph by a function of \(k_ d\) (Q1180676) (← links)
- Amorphous association schemes over the Galois rings of characteristic 4 (Q1180797) (← links)
- Improvement of Bruck's completion theorem (Q1182407) (← links)
- A remark on the intersection arrays of distance regular graphs and the distance regular graphs of diameter \(d=3i -1\) with \(b_ i =1\) and \(k>2\) (Q1182424) (← links)
- A new condition for distance-regular graphs (Q1185869) (← links)
- A new family of distance-regular graphs and the \(\{ 0,1,2 \}\)-cliques in dual polar graphs (Q1193540) (← links)
- Two-graphs and doubly transitive groups (Q1194753) (← links)
- Almost rank three graphs (Q1195476) (← links)
- Locally \(K_{3,3}\) or Petersen graphs (Q1199580) (← links)
- Structure and uniqueness of the \((81,20,1,6)\) strongly regular graph (Q1199584) (← links)
- Extension operations for cuts (Q1199597) (← links)
- Local indecomposability of certain geometric graphs (Q1199607) (← links)
- Completely regular codes (Q1199625) (← links)
- Facets for the cut cone. I (Q1199749) (← links)
