The Signed Graphs with Two Eigenvalues Unequal to ±1

Willem Haemers; Hatice Topcu

doi:10.48550/arXiv.2301.01623

The Signed Graphs with Two Eigenvalues Unequal to ±1

Willem Haemers, Hatice Topcu

Econometrics and OR

Research output: Working paper › Other research output

106 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 $\pm 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
Place of Publication	Ithaca
Publisher	Cornell University Library
Number of pages	20
DOIs	https://doi.org/10.48550/arXiv.2301.01623
Publication status	Published - Jan 2023

Keywords

math.CO
05C50

Access to Document

10.48550/arXiv.2301.01623

2301.01623v1Submitted manuscript, 236 KB

Cite this

@techreport{7a9accb1c46e4c31a201e5b8ab1ad76f,

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 $\pm 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 = "math.CO, 05C50",

author = "Willem Haemers and Hatice Topcu",

year = "2023",

month = jan,

doi = "10.48550/arXiv.2301.01623",

language = "English",

publisher = "Cornell University Library",

type = "WorkingPaper",

institution = "Cornell University Library",

}

TY - UNPB

T1 - The Signed Graphs with Two Eigenvalues Unequal to ±1

AU - Haemers, Willem

AU - Topcu, Hatice

PY - 2023/1

Y1 - 2023/1

N2 - We complete the determination of the signed graphs for which the adjacency matrix has all but at most two eigenvalues equal to $\pm 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 $\pm 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 - math.CO

KW - 05C50

U2 - 10.48550/arXiv.2301.01623

DO - 10.48550/arXiv.2301.01623

M3 - Working paper

BT - The Signed Graphs with Two Eigenvalues Unequal to ±1

PB - Cornell University Library

CY - Ithaca

ER -

The Signed Graphs with Two Eigenvalues Unequal to ±1

Abstract

Keywords

Access to Document

Fingerprint

Cite this