Signed graphs with at most three eigenvalues
From MaRDI portal
Publication:5071593
DOI10.21136/CMJ.2021.0256-20OpenAlexW3135374169MaRDI QIDQ5071593
Farzaneh Ramezani, Zoran Stanić, Peter Rowlinson
Publication date: 22 April 2022
Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.21136/cmj.2021.0256-20
Related Items (3)
More on signed graphs with at most three eigenvalues ⋮ Bipartite graphs with all but two eigenvalues equal to \(0\) and \(\pm 1\) ⋮ Signed graphs with all but two eigenvalues equal to \(\pm 1\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomial reconstruction of signed graphs
- Biregular graphs with three eigenvalues
- On graphs with just three distinct eigenvalues
- Regular graphs. A spectral approach
- Graphs with three eigenvalues and second largest eigenvalue at most 1
- On eigenvalue multiplicity in signed graphs
- Signed graphs
- Nonregular graphs with three eigenvalues
- Three-class association schemes
- On strongly regular signed graphs
- Spectra of signed graphs with two eigenvalues
- On regular signed graphs with three eigenvalues
- On signed graphs with just two distinct adjacency eigenvalues
- On the Laplacian coefficients of signed graphs
- Integer symmetric matrices having all their eigenvalues in the interval \([ - 2,2\)]
- Matrices in the Theory of Signed Simple Graphs
- On the classification of weighing matrices and self-orthogonal codes
- More on graphs with just three distinct eigenvalues
- On the signed graphs with two distinct eigenvalues
- Certain 3-decompositions of complete graphs, with an application to finite fields
- Open problems in the spectral theory of signed graphs
- Integral regular net-balanced signed graphs with vertex degree at most four
- Some regular signed graphs with only two distinct eigenvalues
This page was built for publication: Signed graphs with at most three eigenvalues
