Spherical two-distance sets and graph eigenvalues

Abstract

A set of unit vectors in ${\mathbb{R}}^d$ is a called a spherical two-distance set if the inner products of distinct vectors only take two values. In this paper, we give explicit correspondence between spherical two-distance sets and graphs with specific spectral properties, and derive some bounds on the maximum size of spherical two-distance sets.