Graph toughness from Laplacian eigenvalues
DOI10.5802/ALCO.197OpenAlexW4214530648MaRDI QIDQ2700326FDOQ2700326
Authors: Xiaofeng Gu, Willem H. Haemers 
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
Recommendations
- Toughness and normalized Laplacian eigenvalues of graphs
- Toughness and spectrum of a graph
- scientific article; zbMATH DE number 5283261
- On the Toughness of a Graph
- On the toughness of graphs
- Toughness, Hamiltonicity and spectral radius in graphs
- Toughness in graphs -- a survey
- On the Laplacian eigenvalues of a graph
- Neighbor toughness of graphs
- A note on Laplacian graph eigenvalues
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Eulerian and Hamiltonian graphs (05C45) Density (toughness, etc.) (05C42) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Matching theory
- Sparse pseudo‐random graphs are Hamiltonian
- Spectra of graphs
- Small spectral gap in the combinatorial Laplacian implies Hamiltonian
- Interlacing eigenvalues and graphs
- Eigenvalue bounds for independent sets
- Matchings in regular graphs from eigenvalues
- Edge-connectivity, eigenvalues, and matchings in regular graphs
- Title not available (Why is that?)
- Bounding the gap between extremal Laplacian eigenvalues of graphs
- On the Laplacian spectral ratio of connected graphs
- On spectral characterization and embeddings of graphs
- Pseudo-random graphs
- Toughness in graphs -- a survey
- Tough graphs and Hamiltonian circuits.
- Laplacian spectral bounds for clique and independence numbers of graphs
- On \(k\)-factor-critical graphs
- Title not available (Why is that?)
- Eigenvalues and perfect matchings
- Tough Ramsey graphs without short cycles
- Toughness and spectrum of a graph
- Algebraic conditions for t-tough graphs
- Title not available (Why is that?)
- The spectrum and toughness of regular graphs
- Toughness, trees, and walks
- Regular graphs, eigenvalues and regular factors
- Regular factors and eigenvalues of regular graphs
- Perfect matchings, eigenvalues and expansion
- Regular factors of regular graphs from eigenvalues
- Large matchings from eigenvalues
- On a connection between the existence of k-trees and the toughness of a graph
- Toughness and matching extension in graphs
- Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs.
- Tutte sets in graphs. II: The complexity of finding maximum Tutte sets
- Toughness and the existence ofk-factors
- Toughness of graphs and the existence of factors
- Toughness and triangle-free graphs
- A tight lower bound on the matching number of graphs via Laplacian eigenvalues
- Hoffman's ratio bound
- Toughness in pseudo-random graphs
- A proof of Brouwer's toughness conjecture
Cited In (12)
- Spanning trees of bounded degree, connectivity, toughness, and the spectrum of a graph
- Toughness and spectral radius in graphs
- A unified framework for the expander mixing lemma for irregular graphs and its applications
- Binding number, \(k\)-factor and spectral radius of graphs
- A unified combinatorial view beyond some spectral properties
- Graph toughness from Laplacian eigenvalues
- \(l\)-connectivity, \(l\)-edge-connectivity and spectral radius of graphs
- Toughness, Hamiltonicity and spectral radius in graphs
- A proof of Brouwer's toughness conjecture
- Spectral bounds for the vulnerability parameters of graphs
- \(\ell\)-connectivity, integrity, tenacity, toughness and eigenvalues of graphs
- Toughness and normalized Laplacian eigenvalues of graphs
This page was built for publication: Graph toughness from Laplacian eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2700326)
