Toughness and spectrum of a graph (Q1899410)
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: Toughness and spectrum of a graph |
scientific article; zbMATH DE number 803741
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Toughness and spectrum of a graph |
scientific article; zbMATH DE number 803741 |
Statements
Toughness and spectrum of a graph (English)
0 references
9 October 1995
0 references
The author proves the following theorem: Let \(G\) be a connected non- complete regular graph of valency \(d\) and let \(\lambda\) be the maximum of the absolute values of the eigenvalues of \(G\) distinct from \(d\). Then the toughness \(t\) of \(G\) satisfies \(t> d/\lambda- 2\).
0 references
eigenvalues
0 references
toughness
0 references
