Spherical two-distance sets and graph eigenvalues
Combinatorics
2025-10-14 v3
Abstract
A set of unit vectors in 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.
Cite
@article{arxiv.2402.11787,
title = {Spherical two-distance sets and graph eigenvalues},
author = {Jiang Zhou},
journal= {arXiv preprint arXiv:2402.11787},
year = {2025}
}