On graphs with a fixed number of negative eigenvalues (Q1071034)
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: On graphs with a fixed number of negative eigenvalues |
scientific article; zbMATH DE number 3937208
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On graphs with a fixed number of negative eigenvalues |
scientific article; zbMATH DE number 3937208 |
Statements
On graphs with a fixed number of negative eigenvalues (English)
0 references
1985
0 references
A graph is called canonical if any two nonadjacent vertices have different neighbours. It is shown that the set of graphs having a fixed number of negative eigenvalues (including multiplicities) contains a finite number of canonical graphs.
0 references
negative eigenvalues
0 references
canonical graphs
0 references
