On signed graphs whose spectral radius does not exceed 2+5
Abstract
The Hoffman program with respect to any real or complex square matrix M associated to a graph G stems from Hoffman's pioneering work on the limit points for the spectral radius of adjacency matrices of graphs does not exceed 2+5. A signed graph G=(G,σ) is a pair (G,σ), where G=(V,E) is a simple graph and σ: E(G)→ \+1,-1\ 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 2+5 will be identified.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.