paper

On signed graphs whose spectral radius does not exceed

arXiv:2203.01530

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.

arXiv comment33 pages, 20 figures