Signed graphs with least eigenvalue \(<-2\) (Q1193558)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Signed graphs with least eigenvalue \(<-2\) |
scientific article; zbMATH DE number 64847
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Signed graphs with least eigenvalue \(<-2\) |
scientific article; zbMATH DE number 64847 |
Statements
Signed graphs with least eigenvalue \(<-2\) (English)
0 references
27 September 1992
0 references
A simple proof is given of the fact that every signed graph with an eigenvalue that is smaller than --2 contains an induced (signed) subgraph whose smallest eigenvalue is equal to --2.
0 references
graph eigenvalue
0 references
signed graph
0 references
