On signed graphs whose spectral radius does not exceed $\sqrt{2+\sqrt{5}}$
Dijian Wang, Wenkuan Dong, Yaoping Hou, Deqiong Li

TL;DR
None
Contribution
None
Abstract
The Hoffman program with respect to any real or complex square matrix associated to a graph stems from Hoffman's pioneering work on the limit points for the spectral radius of adjacency matrices of graphs does not exceed . A signed graph is a pair where is a simple graph and is the sign function. In this paper, we study the Hoffman program of signed graphs. Here, all signed graphs whose spectral radius does not exceed will be identified.
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
TopicsMatrix Theory and Algorithms · Graph theory and applications · Advanced Topics in Algebra
