Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/722| Title: | More on Signed Graphs with at Most Three Eigenvalues | Authors: | Ramezani, Farzaneh Rowlinson, Peter Stanić, Zoran |
Affiliations: | Numerical Mathematics and Optimization | Keywords: | adjacency matrix;association scheme;simple eigenvalue;strongly regular signed graph;vertex-deleted subgraph;weighing matrix | Issue Date: | 2022 | Journal: | Discussiones Mathematicae - Graph Theory | Abstract: | 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-class association schemes. |
URI: | https://research.matf.bg.ac.rs/handle/123456789/722 | ISSN: | 12343099 | DOI: | 10.7151/dmgt.2393 |
| Appears in Collections: | Research outputs |
Show full item record
SCOPUSTM
Citations
7
checked on Nov 9, 2024
Page view(s)
43
checked on Nov 14, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.