More on signed graphs with at most three eigenvalues

DOI10.7151/dmgt.2393zbMath1493.05146OpenAlexW3132961404MaRDI QIDQ2158204

Peter Rowlinson, Zoran Stanić, Farzaneh Ramezani

Publication date: 26 July 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2393

zbMATH Keywords

association schemeadjacency matrixvertex-deleted subgraphsimple eigenvalueweighing matrixstrongly regular signed graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22)

Related Items (3)

Notes on the polynomial reconstruction of signed graphs ⋮ Signed graphs with all but two eigenvalues equal to \(\pm 1\) ⋮ The polynomial reconstruction problem: the first 50 years

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Biregular graphs with three eigenvalues
• On graphs with just three distinct eigenvalues
• Graphs with three eigenvalues and second largest eigenvalue at most 1
• On eigenvalue multiplicity in signed graphs
• Nonregular graphs with three eigenvalues
• Inverses of \(2\times 2\) block matrices
• On strongly regular signed graphs
• On regular signed graphs with three eigenvalues
• Matrices in the Theory of Signed Simple Graphs
• On the Shannon capacity of a graph
• More on graphs with just three distinct eigenvalues
• Signed graphs with at most three eigenvalues
• Main eigenvalues of real symmetric matrices with application to signed graphs
• On a class of strongly regular signed graphs
• Some regular signed graphs with only two distinct eigenvalues

This page was built for publication: More on signed graphs with at most three eigenvalues