Graph toughness from Laplacian eigenvalues
From MaRDI portal
Publication:2700326
DOI10.5802/alco.197OpenAlexW4214530648MaRDI QIDQ2700326
Willem H. Haemers, Xiaofeng Gu
Publication date: 20 April 2023
Published in: Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.03845
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eigenvalues, singular values, and eigenvectors (15A18) Eulerian and Hamiltonian graphs (05C45) Density (toughness, etc.) (05C42)
Related Items (5)
Toughness and normalized Laplacian eigenvalues of graphs ⋮ Spectral bounds for the vulnerability parameters of graphs ⋮ Binding number, \(k\)-factor and spectral radius of graphs ⋮ Toughness, Hamiltonicity and spectral radius in graphs ⋮ \(\ell\)-connectivity, integrity, tenacity, toughness and eigenvalues of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The spectrum and toughness of regular graphs
- Regular factors and eigenvalues of regular graphs
- On the Laplacian spectral ratio of connected graphs
- Regular factors of regular graphs from eigenvalues
- Spectra of graphs
- Small spectral gap in the combinatorial Laplacian implies Hamiltonian
- On spectral characterization and embeddings of graphs
- Large matchings from eigenvalues
- Eigenvalue bounds for independent sets
- Matchings in regular graphs from eigenvalues
- Matching theory
- On a connection between the existence of k-trees and the toughness of a graph
- Eigenvalues and perfect matchings
- Toughness of graphs and the existence of factors
- Toughness and matching extension in graphs
- Tough Ramsey graphs without short cycles
- Toughness and spectrum of a graph
- Interlacing eigenvalues and graphs
- Toughness and triangle-free graphs
- A tight lower bound on the matching number of graphs via Laplacian eigenvalues
- Toughness in pseudo-random graphs
- Tutte sets in graphs. II: The complexity of finding maximum Tutte sets
- Toughness in graphs -- a survey
- Bounding the gap between extremal Laplacian eigenvalues of graphs
- Tough graphs and Hamiltonian circuits.
- Laplacian spectral bounds for clique and independence numbers of graphs
- Hoffman's ratio bound
- On k-factor-critical graphs
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs
- Regular Graphs, Eigenvalues and Regular Factors
- Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs
- Algebraic conditions for t-tough graphs
- Toughness and the existence ofk-factors
- Sparse pseudo‐random graphs are Hamiltonian
- Toughness, trees, and walks
- A Proof of Brouwer's Toughness Conjecture
This page was built for publication: Graph toughness from Laplacian eigenvalues
