More on Signed Graphs with at Most Three Eigenvalues

We consider signed graphs with just 2 or 3 distinct eigenvalues, in particular (i) those with at least one simple eigenvalue, and (ii) those with vertex-deleted subgraphs which themselves have at most 3 distinct eigenvalues. We also construct new examples using weighing matrices and symmetric 3-clas...

Full description

Bibliographic Details
Main Authors: Ramezani Farzaneh, Rowlinson Peter, Stanić Zoran
Format: Article
Language:English
Published: University of Zielona Góra 2022-11-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
Online Access:https://doi.org/10.7151/dmgt.2393