Maximal digraphs whose Hermitian spectral radius is at most 2

DOI10.1016/J.LAA.2022.11.007MaRDI QIDQ2104985zbMATH OpenOpenAlexFDO

Authors Alexander L. Gavrilyuk, Akihiro Munemasa

Publication date 8 December 2022

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2109.09114

zbMATH Keywords

digraphDynkin diagrameigenvalueHermitian matrixintegral latticeroot system

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57)

Abstract: We classify maximal digraphs whose Hermitian spectral radius is at most $2$.

Cites work

• Class numbers of definite Hermitian forms
• Cyclotomic matrices over the Eisenstein and Gaussian integers
• Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths
• Equiangular lines
• Even unimodular Gaussian lattices of rank 12
• Hermitian adjacency spectrum and switching equivalence of mixed graphs
• Hermitian-adjacency matrices and Hermitian energies of mixed graphs
• scientific article; zbMATH DE number 3394189 (Why is no real title available?)
• Integer symmetric matrices having all their eigenvalues in the interval \([ - 2,2]\)
• Lattices and codes. A course partially based on lectures by Friedrich Hirzebruch
• Line graphs, root systems, and elliptic geometry
• On mixed graphs whose Hermitian spectral radii are at most 2
• Signed analogue of line graphs and their smallest eigenvalues

Cited in

(1)

• The Hoffman program for mixed graphs

This page was built for publication: Maximal digraphs whose Hermitian spectral radius is at most 2

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104985)