Toughness and spectrum of a graph

Research output: Contribution to journal › Article › Academic › peer-review

36 Citations (Scopus)

Abstract

We derive (asymptotically best possible) lower bounds for the toughness of a graph in terms of its eigenvalues.

Original language	English
Pages (from-to)	267-271
Journal	Linear Algebra and Its Applications
Volume	226-228
DOIs	https://doi.org/10.1016/0024-3795(95)00154-J
Publication status	Published - 1995

@article{48bff900dc874f9dbe61331b1b9fdcb3,

title = "Toughness and spectrum of a graph",

abstract = "We derive (asymptotically best possible) lower bounds for the toughness of a graph in terms of its eigenvalues.",

author = "A.E. Brouwer",

year = "1995",

doi = "10.1016/0024-3795(95)00154-J",

language = "English",

volume = "226-228",

pages = "267--271",

journal = "Linear Algebra and Its Applications",

issn = "0024-3795",

publisher = "Elsevier",

}

TY - JOUR

T1 - Toughness and spectrum of a graph

AU - Brouwer, A.E.

PY - 1995

Y1 - 1995

N2 - We derive (asymptotically best possible) lower bounds for the toughness of a graph in terms of its eigenvalues.

AB - We derive (asymptotically best possible) lower bounds for the toughness of a graph in terms of its eigenvalues.

U2 - 10.1016/0024-3795(95)00154-J

DO - 10.1016/0024-3795(95)00154-J

M3 - Article

SN - 0024-3795

VL - 226-228

SP - 267

EP - 271

JO - Linear Algebra and Its Applications

JF - Linear Algebra and Its Applications

ER -