Toughness and spectrum of a graph (Q1899410): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0024-3795(95)00154-j / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2120972848 / rank | |||
Normal rank | |||
Latest revision as of 09:50, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Toughness and spectrum of a graph |
scientific article |
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
