Item

On signed graphs with at most two eigenvalues unequal to ±1

Haemers,Willem H.
; 
Topcu,Hatice
Abstract
We present the first steps towards the determination of the signed graphs for which the adjacency matrix has all but at most two eigenvalues equal to ±1. Here we deal with the disconnected, the bipartite and the complete signed graphs. In addition, we present many examples which cannot be obtained from an unsigned graph or its negative by switching.
Description
Funding Information: We thank Hakan Küçük for checking which graphs from the list of Stanić belong to G. Publisher Copyright: © 2023 The Author(s)
Date
2023-08-01
Journal Title
Journal ISSN
Volume Title
Publisher
Collections
Tilburg University Research Output Collection
Show all metadata
Research Projects
Organizational Units
Journal Issue
Keywords
Friendship graph, Graph spectrum, Seidel spectrum, Signed graph, Spectral characterization, Symmetric spectrum
Citation
Haemers, W H & Topcu, H 2023, 'On signed graphs with at most two eigenvalues unequal to ±1', Linear Algebra and its Applications, vol. 670, pp. 68-77. https://doi.org/10.1016/j.laa.2023.04.001
URI
https://hdl.handle.net/20.500.14602/79176
License
info:eu-repo/semantics/openAccess
Embedded videos