The spectrum and toughness of regular graphs
From MaRDI portal
Publication:403562
DOI10.1016/j.dam.2013.12.004zbMath1298.05200arXiv1312.2247OpenAlexW2083125802MaRDI QIDQ403562
Wiseley Wong, Sebastian M. Cioabă
Publication date: 29 August 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.2247
Extremal problems in graph theory (05C35) Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Toughness and normalized Laplacian eigenvalues of graphs ⋮ Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph ⋮ Sharp spectral bounds for the vertex-connectivity of regular 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 ⋮ The toughness of Kneser graphs ⋮ Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs ⋮ A Proof of Brouwer's Toughness Conjecture
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectra of graphs
- Matchings in regular graphs from eigenvalues
- The connectivity of strongly regular graphs
- The complexity of recognizing tough cubic graphs
- Tough Ramsey graphs without short cycles
- Toughness and spectrum of a graph
- Interlacing eigenvalues and graphs
- Not every 2-tough graph is Hamiltonian
- Toughness in graphs -- a survey
- Closed walks and eigenvalues of abelian Cayley graphs
- Tough graphs and Hamiltonian circuits.
- Algebraic conditions for t-tough graphs
- Hamiltonian results inK1,3-free graphs
This page was built for publication: The spectrum and toughness of regular graphs
