Maximal digraphs whose Hermitian spectral radius is at most 2

DOI10.1016/J.LAA.2022.11.007zbMATH Open1504.05163arXiv2109.09114OpenAlexW3200672812MaRDI QIDQ2104985FDOQ2104985

Alexander L. Gavrilyuk, Akihiro Munemasa

Publication date: 8 December 2022

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

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

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

zbMATH Keywords

eigenvalueHermitian matrixdigraphroot systemDynkin diagramintegral lattice

Mathematics Subject Classification ID

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

Cites Work

• Lattices and Codes
• Title not available (Why is that?)
• Equiangular lines
• Line graphs, root systems, and elliptic geometry
• Cyclotomic matrices over the Eisenstein and Gaussian integers
• Integer symmetric matrices having all their eigenvalues in the interval \([ - 2,2]\)
• Large regular bipartite graphs with median eigenvalue 1
• Hermitian-adjacency matrices and Hermitian energies of mixed graphs
• Hermitian adjacency spectrum and switching equivalence of mixed graphs
• Even unimodular Gaussian lattices of rank 12
• Class numbers of definite Hermitian forms
• Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths
• On mixed graphs whose Hermitian spectral radii are at most 2
• Signed analogue of line graphs and their smallest eigenvalues

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)