On Signed Graphs With at Most Two Eigenvalues Unequal to ±1

Willem H. Haemers; Hatice Topcu

On Signed Graphs With at Most Two Eigenvalues Unequal to ±1

Willem H. Haemers, Hatice Topcu

Econometrics and OR

Research output: Book/Report › Report

102 Downloads (Pure)

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

Original language	English
Place of Publication	Ithaca
Publisher	Cornell University Library
Publication status	Published - 6 Sept 2021

Publication series

Name	Preprint at arXiv
Volume	2109.02522

Keywords

math.CO

Access to Document

2109.02522v1Submitted manuscript, 129 KB

https://arxiv.org/abs/2109.02522v1

Cite this

@book{753240bf51104805af1f9c7953cca108,

title = "On Signed Graphs With at Most Two Eigenvalues Unequal to ±1",

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 or -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. ",

keywords = "math.CO",

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

year = "2021",

month = sep,

day = "6",

language = "English",

series = "Preprint at arXiv",

publisher = "Cornell University Library",

}

TY - BOOK

T1 - On Signed Graphs With at Most Two Eigenvalues Unequal to ±1

AU - Haemers, Willem H.

AU - Topcu, Hatice

PY - 2021/9/6

Y1 - 2021/9/6

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

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

KW - math.CO

M3 - Report

T3 - Preprint at arXiv

BT - On Signed Graphs With at Most Two Eigenvalues Unequal to ±1

PB - Cornell University Library

CY - Ithaca

ER -

On Signed Graphs With at Most Two Eigenvalues Unequal to ±1

Abstract

Publication series

Keywords

Access to Document

Fingerprint

Cite this