Toughness and spectrum of a graph

A.E. Brouwer

Research output: Contribution to journalArticleAcademicpeer-review

13 Citations (Scopus)


We derive (asymptotically best possible) lower bounds for the toughness of a graph in terms of its eigenvalues.
Original languageEnglish
Pages (from-to)267-271
JournalLinear Algebra and Its Applications
Publication statusPublished - 1995

Fingerprint Dive into the research topics of 'Toughness and spectrum of a graph'. Together they form a unique fingerprint.

Cite this