Maximality of Seidel matrices and switching roots of graphs
From MaRDI portal
Publication:2051870
Abstract: In this paper, we discuss maximality of Seidel matrices with a fixed largest eigenvalue. We present a classification of maximal Seidel matrices of largest eigenvalue , which gives a classification of maximal equiangular lines in a Euclidean space with angle . Motivated by the maximality of the exceptional root system , we define strong maximality of a Seidel matrix, and show that every Seidel matrix achieving the absolute bound is strongly maximal.
Recommendations
Cites work
- Equiangular line systems and switching classes containing regular graphs
- Equiangular lines
- Equiangular lines and the Lemmens-Seidel conjecture
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3225111 (Why is no real title available?)
- Saturated configuration and new large construction of equiangular lines
- Spectra of graphs
- The regular two-graph on 276 vertices
- Upper bounds for \(s\)-distance sets and equiangular lines
Cited in
(6)- Enumeration of Seidel matrices
- There does not exist a strongly regular graph with parameters \((1911, 270, 105, 27)\)
- Spectral proofs of maximality of some Seidel matrices
- Enumeration of sets of equiangular lines with common angle ((1 / 3))
- Sets of equiangular lines in dimension 18 constructed from A₉ A₉ A₁
- A 2-distance set with 277 points in the euclidean space of dimension 23
This page was built for publication: Maximality of Seidel matrices and switching roots of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2051870)