Maximality of Seidel matrices and switching roots of graphs
From MaRDI portal
Publication:2051870
DOI10.1007/s00373-021-02359-wzbMath1479.05194arXiv2102.11989OpenAlexW3198413200MaRDI QIDQ2051870
Jack H. Koolen, Kiyoto Yoshino, Akihiro Munemasa, Meng-Yue Cao
Publication date: 25 November 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.11989
Related Items (2)
There does not exist a strongly regular graph with parameters \((1911, 270, 105, 27)\) ⋮ Spectral Proofs of Maximality of Some Seidel Matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Spectra of graphs
- The regular two-graph on 276 vertices
- Upper bounds for \(s\)-distance sets and equiangular lines
- Saturated configuration and new large construction of equiangular lines
- Equiangular lines and the Lemmens-Seidel conjecture
- Equiangular line systems and switching classes containing regular graphs
- Equiangular lines
This page was built for publication: Maximality of Seidel matrices and switching roots of graphs