The Hoffman program for mixed graphs
From MaRDI portal
Cites work
- Cyclotomic matrices over the Eisenstein and Gaussian integers
- Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths
- Hermitian adjacency matrix of digraphs and mixed graphs
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- scientific article; zbMATH DE number 3465473 (Why is no real title available?)
- scientific article; zbMATH DE number 3482387 (Why is no real title available?)
- scientific article; zbMATH DE number 3794105 (Why is no real title available?)
- scientific article; zbMATH DE number 3394189 (Why is no real title available?)
- Integer symmetric matrices having all their eigenvalues in the interval \([ - 2,2]\)
- Limit points for the spectral radii of signed graphs
- Maximal digraphs whose Hermitian spectral radius is at most 2
- On graphs whose orientations are determined by their Hermitian spectra
- On mixed graphs whose Hermitian spectral radii are at most 2
- On signed graphs whose spectral radius does not exceed \(\sqrt{2 + \sqrt{5}}\)
- On the distribution of the maximum eigenvalues of graphs
- On the spectrum of complex unit gain graphs
- Open problems in the spectral theory of signed graphs
- Spectral characterizations of dumbbell graphs
- Spectral fundamentals and characterizations of signed directed graphs
- The graphs with spectral radius between 2 and \(\sqrt{2+\sqrt{5}}\)
- The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum
This page was built for publication: The Hoffman program for mixed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6932123)
