On the multiplicities of digraph eigenvalues
From MaRDI portal
Abstract: We show various upper bounds for the order of a digraph (or a mixed graph) whose Hermitian adjacency matrix has an eigenspace of prescribed codimension. In particular, this generalizes the so-called absolute bound for (simple) graphs first shown by Delsarte, Goethals, and Seidel (1977) and extended by Bell and Rowlinson (2003). In doing so, we also adapt the Blokhuis' theory (1983) of harmonic analysis in real hyperbolic spaces to that in complex hyperbolic spaces.
Recommendations
Cites work
- A new kind of Hermitian matrices for digraphs
- Co-cliques and star complements in extremal strongly regular graphs
- Complex spherical codes with three inner products
- Complex spherical codes with two inner products
- Complex spherical designs and codes
- Eigenspaces of graphs
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 3815662 (Why is no real title available?)
- scientific article; zbMATH DE number 3670480 (Why is no real title available?)
- scientific article; zbMATH DE number 3752888 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 3513797 (Why is no real title available?)
- Interlacing eigenvalues and graphs
- ON THE MULTIPLICITIES OF GRAPH EIGENVALUES
- Random matrices have simple spectrum
- Ranks of matrices with few distinct entries
- Spherical codes and designs
- Star complements in regular graphs: old and new results
- Strongly regular graphs having strongly regular subconstituents
Cited in
(3)
This page was built for publication: On the multiplicities of digraph eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6161130)