The Hoffman program for mixed graphs
Yuantian Yu, Edwin R. van Dam

TL;DR
This paper investigates the spectral properties of mixed graphs, specifically identifying graphs with spectral radii below a certain threshold and characterizing their limit points, extending Hoffman's program.
Contribution
It determines all mixed graphs without negative 4-cycles with spectral radius at most rac{rac{2+rac{5}{2}}}{} and identifies all limit points of spectral radii.
Findings
Characterization of mixed graphs without negative 4-cycles with spectral radius rac{rac{2+rac{5}{2}}}{}
Identification of all limit points of spectral radii of mixed graphs
Extension of Hoffman's program to mixed graphs
Abstract
We consider Hoffman's program about the limit points of the spectral radius of the Hermitian adjacency matrix of mixed graphs. In particular, we determine all mixed graphs without negative -cycle whose spectral radius does not exceed , and identify all limit points of spectral radii of mixed graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Complexity and Algorithms in Graphs
