Toughness and spectrum of a graph

DOI10.1016/0024-3795(95)00154-JzbMath0833.05048OpenAlexW2120972848MaRDI QIDQ1899410

Andries E. Brouwer

Publication date: 9 October 1995

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(95)00154-j

zbMATH Keywords

eigenvaluestoughness

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

Toughness and normalized Laplacian eigenvalues of graphs, Interlacing eigenvalues and graphs, Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph, The spectrum and toughness of regular graphs, ℓ $\ell $‐Connectivity and ℓ $\ell $‐edge‐connectivity of random graphs, Spectral bounds for the vulnerability parameters of graphs, Sharp spectral bounds for the vertex-connectivity of regular graphs, Edge-disjoint spanning trees and eigenvalues of regular graphs, Binding number, \(k\)-factor and spectral radius of graphs, Spectral conditions for connectivity, toughness and perfect \(k\)-matchings of regular graphs, Graph toughness from Laplacian eigenvalues, Toughness, Hamiltonicity and spectral radius in graphs, Toughness in pseudo-random graphs, Triangle-free graphs whose independence number equals the degree, Toughness in graphs -- a survey, The toughness of Kneser graphs, Algebraic conditions for t-tough graphs, Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs, A Proof of Brouwer's Toughness Conjecture, \(\ell\)-connectivity, integrity, tenacity, toughness and eigenvalues of graphs

Cites Work

• Tough Ramsey graphs without short cycles
• Interlacing eigenvalues and graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item