Distances, graphs and designs
From MaRDI portal
Cites work
- 2-designs having an intersection number k-n
- \(t{1\over 2}\)-designs
- scientific article; zbMATH DE number 3670480 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- Near-regularity conditions for designs
- On incidence matrices of finite projective and affine spaces
- On some Theorems in Combinatorics Relating to Incomplete Block Designs
- Quasi-residual 2-designs, 1,5-designs, and strongly regular multigraphs
- Spherical codes and designs
- Strongly regular graphs
- Strongly Regular Graphs Derived from Combinatorial Designs
- Strongly regular graphs with smallest eigenvalue -m
- Strongly regular graphs, partial geometries and partially balanced designs
Cited in
(13)- A survey on spherical designs and algebraic combinatorics on spheres
- Duality in coherent configurations
- A note on distance matrices with unicyclic graph realizations
- Classification of graphs by regularity
- Distance matrices and \(n\)-dimensional designs
- Isometric embeddings and geometric designs
- Polynomial spaces
- Great antipodal sets on complex Grassmannian manifolds as designs with the smallest cardinalities
- On the nullspace, the rangespace and the characteristic polynomial of Euclidean distance matrices
- QUANTUM DESIGNS: FOUNDATIONS OF A NONCOMMUTATIVE DESIGN THEORY
- t-designs in projective spaces
- Parameters of t-designs in \({\mathbb{F}}P^{d-1}\)
- Derived eigenvalues of symmetric matrices, with applications to distance geometry
This page was built for publication: Distances, graphs and designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1140086)
