The signed graphs with two eigenvalues unequal to ±1

Willem H. Haemers and Hatice Topcu

Applied Mathematics and Computation, 2024, vol. 463, issue C

Abstract: We complete the determination of the signed graphs for which the adjacency matrix has all but at most two eigenvalues equal to ±1. The unsigned graphs and the disconnected, the bipartite and the complete signed graphs with this property have already been determined in two earlier papers. Here we deal with the remaining cases.

Keywords: Signed graph; Graph spectrum; Spectral characterization (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300323005179
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:463:y:2024:i:c:s0096300323005179

DOI: 10.1016/j.amc.2023.128348

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().