The signed graphs with two eigenvalues unequal to ±1

Willem H. Haemers; Hatice Topcu

doi:10.1016/j.amc.2023.128348

The signed graphs with two eigenvalues unequal to ±1

Willem H. Haemers, Hatice Topcu^*

^*Corresponding author for this work

Econometrics and OR

Research output: Contribution to journal › Article › Scientific › peer-review

10 Downloads (Pure)

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.

Original language	English
Article number	128348
Number of pages	14
Journal	Applied Mathematics and Computation
Volume	463
DOIs	https://doi.org/10.1016/j.amc.2023.128348
Publication status	Published - 15 Feb 2024

Keywords

Graph spectrum
Signed graph
Spectral characterization

Access to Document

10.1016/j.amc.2023.128348

1-s2.0-S0096300323005179-mainFinal published version, 621 KB

Cite this

@article{331a6f0f9a9a461e9e7f507df2d7effc,

title = "The signed graphs with two eigenvalues unequal to ±1",

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 = "Graph spectrum, Signed graph, Spectral characterization",

author = "Haemers, {Willem H.} and Hatice Topcu",

year = "2024",

month = feb,

day = "15",

doi = "10.1016/j.amc.2023.128348",

language = "English",

volume = "463",

journal = "Applied Mathematics and Computation",

issn = "0096-3003",

publisher = "Elsevier Inc.",

}

TY - JOUR

T1 - The signed graphs with two eigenvalues unequal to ±1

AU - Haemers, Willem H.

AU - Topcu, Hatice

PY - 2024/2/15

Y1 - 2024/2/15

N2 - 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.

AB - 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.

KW - Graph spectrum

KW - Signed graph

KW - Spectral characterization

U2 - 10.1016/j.amc.2023.128348

DO - 10.1016/j.amc.2023.128348

M3 - Article

AN - SCOPUS:85173135473

SN - 0096-3003

VL - 463

JO - Applied Mathematics and Computation

JF - Applied Mathematics and Computation

M1 - 128348

ER -

The signed graphs with two eigenvalues unequal to ±1

Abstract

Keywords

Access to Document

Fingerprint

Cite this