Equiangular lines and covers of the complete graph
From MaRDI portal
(Redirected from Publication:896854)
Abstract: The relation between equiangular sets of lines in the real space and distance-regular double covers of the complete graph is well known and studied since the work of Seidel and others in the 70's. The main topic of this paper is to continue the study on how complex equiangular lines relate to distance-regular covers of the complete graph with larger index. Given a set of equiangular lines meeting the relative (or Welch) bound, we show that if the entries of the corresponding Gram matrix are prime roots of unity, then these lines can be used to construct an antipodal distance-regular graph of diameter three. We also study in detail how the absolute (or Gerzon) bound for a set of equiangular lines can be used to derive bounds of the parameters of abelian distance-regular covers of the complete graph.
Recommendations
- Covering line graphs with equivalence relations
- Equistable simplicial, very well-covered, and line graphs
- Graph representations, two-distance sets, and equiangular lines
- Perfect Graphs and Orthogonally Convex Covers
- Equiangular line systems and switching classes containing regular graphs
- Equiangular lines and the Lemmens-Seidel conjecture
- scientific article; zbMATH DE number 4110709
- Publication:4892000
- Covers of point-hyperplane graphs
- Convex covers of graphs
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 867473 (Why is no real title available?)
- scientific article; zbMATH DE number 926602 (Why is no real title available?)
- scientific article; zbMATH DE number 3225111 (Why is no real title available?)
- A new construction of antipodal distance regular covers of complete graphs through the use of Godsil-Hensel matrices
- Distance regular covers of complete graphs from Latin squares
- Distance regular covers of the complete graph
- Equiangular lines
- Generalized welch bound equality sequences are tight frames
- Kirkman Equiangular Tight Frames and Codes
- Spectra of graphs
- Steiner equiangular tight frames
- Strongly Regular Graphs Derived from Combinatorial Designs
- Symmetric informationally complete positive-operator-valued measures: a new computer study
- Symmetric informationally complete–positive operator valued measures and the extended Clifford group
Cited in
(18)- Grassmannian codes from paired difference sets
- Doubly transitive lines. I: Higman pairs and roux
- Graph covers with two new eigenvalues
- Packings in real projective spaces
- Complex two-graphs
- Equiangular tight frames from group divisible designs
- Sets of complex unit vectors with few inner products and distance-regular graphs
- \(p\)-adic Welch bounds and \(p\)-adic Zauner conjecture
- Equi-isoclinic subspaces, covers of the complete graph, and complex conference matrices
- Harmonic equiangular tight frames comprised of regular simplices
- Covers of complete graphs and related association schemes
- Polyphase equiangular tight frames and abelian generalized quadrangles
- Tremain equiangular tight frames
- On \(G\)-vertex-transitive covers of complete graphs having at most two \(G\)-orbits on the arc set
- Unit gain graphs with two distinct eigenvalues and systems of lines in complex space
- Equiangular tight frames that contain regular simplices
- Frames over finite fields: basic theory and equiangular lines in unitary geometry
- Doubly transitive lines. II: Almost simple symmetries
This page was built for publication: Equiangular lines and covers of the complete graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896854)
