Toughness in pseudo-random graphs

DOI10.1016/J.EJC.2020.103255MaRDI QIDQ2225447zbMATH OpenOpenAlexFDO

Authors Xiaofeng Gu

Publication date 8 February 2021

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejc.2020.103255

zbMATH Keywords

generalized vertex connectivitygraph toughness

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• A proof of Brouwer's toughness conjecture
• The spectrum and toughness of regular graphs
• Toughness and spectrum of a graph
• Pseudo-random graphs
• Toughness and normalized Laplacian eigenvalues of graphs

Cites work

• Bounds on the size of graphs of given order and \(l\)-connectivity
• Connectivity, toughness, spanning trees of bounded degree, and the spectrum of regular graphs.
• Edge-disjoint spanning trees and eigenvalues
• Edge-disjoint spanning trees and eigenvalues of regular graphs
• Edge-Disjoint Spanning Trees of Finite Graphs
• Edge-disjoint spanning trees, edge connectivity, and eigenvalues in graphs
• Eigenvalues and edge-connectivity of regular graphs
• Explicit construction of linear sized tolerant networks
• scientific article; zbMATH DE number 997668 (Why is no real title available?)
• scientific article; zbMATH DE number 4027516 (Why is no real title available?)
• scientific article; zbMATH DE number 4099367 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• Note on edge-disjoint spanning trees and eigenvalues
• On the Problem of Decomposing a Graph into n Connected Factors
• Pseudo-random graphs
• Spectra of graphs
• Spectral bounds for the connectivity of regular graphs with given order
• The spectrum and toughness of regular graphs
• Tough graphs and Hamiltonian circuits.
• Tough Ramsey graphs without short cycles
• Toughness and spectrum of a graph
• Toughness in graphs -- a survey

Cited in

(17)

• Toughness and spectrum of a graph
• Spectral conditions for graph rigidity in the Euclidean plane
• Toughness and normalized Laplacian eigenvalues 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
• The spectrum and toughness of regular graphs
• A proof of Brouwer's toughness conjecture
• ℓ $\ell $‐Connectivity and ℓ $\ell $‐edge‐connectivity of random graphs
• Binding number, \(k\)-factor and spectral radius of graphs
• A unified framework for the expander mixing lemma for irregular graphs and its applications
• A unified combinatorial view beyond some spectral properties
• l-connectivity, l-edge-connectivity and spectral radius of graphs
• Generalized toughness and spectral radius of graphs
• Eigenvalues and toughness of regular graphs
• Eigenvalues and factors: a survey
• Toughness and distance spectral radius in graphs

This page was built for publication: Toughness in pseudo-random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2225447)