Toughness and spectrum of a graph
type: Item
instance of: scholarly article
title: Toughness and spectrum of a graph
zbMATH Open document ID: 0833.05048
DOI: 10.1016/0024-3795(95)00154-J
author: Andries E. Brouwer
published in: Linear Algebra and its Applications
publication date: 1995-10-09T00:00:00Z
review text: 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\).
reviewed by: B. Andrasfai
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 803741
zbMATH Keywords: eigenvalues
zbMATH Keywords: toughness
MaRDI profile type: Publication
cites work: Tough Ramsey graphs without short cycles
cites work: Q3992965
cites work: Q3866128
cites work: Interlacing eigenvalues and graphs
cites work: Q4862113
full work available at URL: 0024-3795(95)00154-j
OpenAlex ID: W2120972848
description: scientific article; zbMATH DE number 803741