Distances, graphs and designs

DOI10.1016/S0195-6698(80)80050-3zbMath0435.05015MaRDI QIDQ1140086

Arnold Neumaier

Publication date: 1980

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

association schemesstrongly regular graphsfinite metric spacesdistance matricest-design

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Other designs, configurations (05B30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (13)

Isometric embeddings and geometric designs ⋮ t-designs in projective spaces ⋮ Duality in coherent configurations ⋮ A note on distance matrices with unicyclic graph realizations ⋮ Great antipodal sets on complex Grassmannian manifolds as designs with the smallest cardinalities ⋮ Classification of graphs by regularity ⋮ Distance matrices and \(n\)-dimensional designs ⋮ Derived eigenvalues of symmetric matrices, with applications to distance geometry ⋮ QUANTUM DESIGNS: FOUNDATIONS OF A NONCOMMUTATIVE DESIGN THEORY ⋮ On the nullspace, the rangespace and the characteristic polynomial of Euclidean distance matrices ⋮ Polynomial spaces ⋮ A survey on spherical designs and algebraic combinatorics on spheres ⋮ Parameters of t-designs in \({\mathbb{F}}P^{d-1}\)

Cites Work

• Unnamed Item
• Unnamed Item
• Quasi-residual 2-designs, 1,5-designs, and strongly regular multigraphs
• 2-designs having an intersection number \(k-n\)
• \(t{1\over 2}\)-designs
• Strongly regular graphs
• Spherical codes and designs
• Strongly regular graphs with smallest eigenvalue -m
• Near-regularity conditions for designs
• On incidence matrices of finite projective and affine spaces
• Strongly regular graphs, partial geometries and partially balanced designs
• Strongly Regular Graphs Derived from Combinatorial Designs
• On some Theorems in Combinatorics Relating to Incomplete Block Designs

This page was built for publication: Distances, graphs and designs