False-twin-free graphs with a fixed number of negative eigenvalues
OPEN ACCESS
Author / Producer
Date
2021-06-01
Publication Type
Journal Article
ETH Bibliography
yes
Citations
Altmetric
OPEN ACCESS
Data
Rights / License
Abstract
We prove a quantitative version of a result of Torgašev concerning graphs with a fixed number of negative eigenvalues. We also establish a structural result stating that if for a hereditary family of graphs every graph of order N + 1 and N + 2 has false twins, then every graph from this family of order greater than N has false twins.
Permanent link
Publication status
published
External links
Editor
Book title
Journal / series
Volume
618
Pages / Article No.
144 - 149
Publisher
Elsevier
Event
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
False twins; Inertia index; Ramsey number
Organisational unit
02003 - Mathematik Selbständige Professuren