On Signed Graphs With at Most Two Eigenvalues Unequal to $\pm 1$

Willem H. Haemers, Hatice Topcu

Research output: Book/ReportReportProfessional

14 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 languageEnglish
Place of PublicationIthaca
PublisherCornell University Library
Publication statusPublished - 6 Sep 2021

Publication series

NamePreprint at arXiv
Volume2109.02522

Keywords

  • math.CO

Fingerprint

Dive into the research topics of 'On Signed Graphs With at Most Two Eigenvalues Unequal to $\pm 1$'. Together they form a unique fingerprint.

Cite this